Wiley
Wiley.com
Print this page Share

Theory of Computational Complexity

ISBN: 978-0-471-34506-0
Hardcover
512 pages
January 2000
US $196.00 Add to Cart

This price is valid for United States. Change location to view local pricing and availability.

Theory of Computational Complexity (0471345067) cover image
This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 5-6 days delivery time. The book is not returnable.
Other Available Formats: E-book

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.