This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others. Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics and probability.
35 pages matching coNP in this book
Results 1-3 of 35
What people are saying - Write a review
Review: Computational ComplexityUser Review - Goodreads
recommended by Scott Aaronson as a conceptual intro to complexity
Review: Computational ComplexityUser Review - dead letter office - Goodreads
i'm not aware of too many choices for introductory graduate complexity theory. this one is not great, but it'll work. Read full review