Related Books
Language: en
Pages: 630
Pages: 630
Type: BOOK - Published: 2013-03-14 - Publisher: Springer Science & Business Media
The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion
Language: en
Pages: 174
Pages: 174
Type: BOOK - Published: 2013-03-14 - Publisher: Springer Science & Business Media
This is a thorough and comprehensive treatment of the theory of NP-completeness in the framework of algebraic complexity theory. Coverage includes Valiant's alg
Language: en
Pages: 162
Pages: 162
Type: BOOK - Published: 1996 - Publisher:
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.
Language: en
Pages:
Pages:
Type: BOOK - Published: 2005 - Publisher:
