Recursion Theory and Computational Complexity

Recursion Theory and Computational Complexity
Author :
Publisher :
Total Pages : 242
Release :
ISBN-10 : 3642110754
ISBN-13 : 9783642110757
Rating : 4/5 (54 Downloads)

Book Synopsis Recursion Theory and Computational Complexity by : G. Lolli

Download or read book Recursion Theory and Computational Complexity written by G. Lolli and published by . This book was released on 2011-03-30 with total page 242 pages. Available in PDF, EPUB and Kindle. Book excerpt:


Recursion Theory and Computational Complexity Related Books

Recursion Theory and Computational Complexity
Language: en
Pages: 242
Authors: G. Lolli
Categories:
Type: BOOK - Published: 2011-03-30 - Publisher:

DOWNLOAD EBOOK

Recursion Theory and Computational Complexity
Language: en
Pages: 228
Authors: G. Lolli
Categories: Mathematics
Type: BOOK - Published: 2011-06-17 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priorit
Recursion Theory and Computational Complexity
Language: en
Pages:
Authors: Gabriele Lolli
Categories:
Type: BOOK - Published: 1981 - Publisher:

DOWNLOAD EBOOK

Computational Complexity
Language: en
Pages: 609
Authors: Sanjeev Arora
Categories: Computers
Type: BOOK - Published: 2009-04-20 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Recursion Theory and Computational Complexity
Language: en
Pages: 236
Authors: G. Lolli
Categories: Mathematics
Type: BOOK - Published: 2010-11-30 - Publisher: Springer

DOWNLOAD EBOOK

S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priorit