|
E-book
Theory of Computational ComplexityISBN: 978-1-118-03116-2
E-book
512 pages
October 2011
 Purchase This E-book
This price is valid for United States. Change location to view local pricing and availability.   
Other Available Formats: Hardcover
|
UNIFORM COMPLEXITY.
Models of Computation and Complexity Classes.
NP-Completeness.
The Polynomial-Time Hierarchy and Polynomial Space.
Structure of NP.
NONUNIFORM COMPLEXITY.
Decision Trees.
Circuit Complexity.
Polynomial-Time Isomorphism.
PROBABILISTIC COMPLEXITY.
Probabilistic Machines and Complexity Classes.
Complexity of Counting.
Interactive Proof Systems.
Probabilistically Checkable Proofs and NP-Hard Optimization Problems.
Bibliography.
Index.
Models of Computation and Complexity Classes.
NP-Completeness.
The Polynomial-Time Hierarchy and Polynomial Space.
Structure of NP.
NONUNIFORM COMPLEXITY.
Decision Trees.
Circuit Complexity.
Polynomial-Time Isomorphism.
PROBABILISTIC COMPLEXITY.
Probabilistic Machines and Complexity Classes.
Complexity of Counting.
Interactive Proof Systems.
Probabilistically Checkable Proofs and NP-Hard Optimization Problems.
Bibliography.
Index.
How to read this e-book on:
