Related Books
Language: en
Pages: 318
Pages: 318
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media
Starting with Cook's pioneering work on NP-completeness in 1970, polynomial complexity theory, the study of polynomial-time com putability, has quickly emerged
Language: en
Pages: 324
Pages: 324
Type: BOOK - Published: 1991-10-01 - Publisher:
Language: en
Pages: 456
Pages: 456
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media
The classical theory of computation has its origins in the work of Goedel, Turing, Church, and Kleene and has been an extraordinarily successful framework for t
Language: en
Pages: 618
Pages: 618
Type: BOOK - Published: 2012-01-06 - Publisher: Springer Science & Business Media
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layma
Language: en
Pages: 609
Pages: 609
Type: BOOK - Published: 2009-04-20 - Publisher: Cambridge University Press
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
