Theory of Computational Complexity / Edition 1 available in Hardcover
- Pub. Date:
A complete treatment of fundamentals and recent advances in complexity theory Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity theory, including fundamental topics as well as recent breakthroughs not previously available in book form. Theory of Computational Complexity offers a thorough presentation of the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization, and the application to cryptography. It also examines the theory of nonuniform computational complexity, including the computational models of decision trees and Boolean circuits, and the notion of polynomial-time isomorphism. The theory of probabilistic complexity, which studies complexity issues related to randomized computation as well as interactive proof systems and probabilistically checkable proofs, is also covered. Extraordinary in both its breadth and depth, this volume:
• Provides complete proofs of recent breakthroughs in complexity theory
• Presents results in well-defined form with complete proofs and numerous exercises
• Includes scores of graphs and figures to clarify difficult material
An invaluable resource for researchers as well as an important guide for graduate and advanced undergraduate students, Theory of Computational Complexity is destined to become the standard reference in the field.
|Series:||Wiley Series in Discrete Mathematics and Optimization Series , #58|
|Product dimensions:||6.40(w) x 9.59(h) x 1.12(d)|
About the Author
DING-ZHU DU, PhD, is a professor in the Department of Computer Science at the University of Minnesota. KER-I KO, PhD, is a professor in the Department of Computer Science at the State University of New York at Stony Brook.
Table of Contents
Models of Computation and Complexity Classes.
The Polynomial-Time Hierarchy and Polynomial Space.
Structure of NP.
Probabilistic Machines and Complexity Classes.
Complexity of Counting.
Interactive Proof Systems.
Probabilistically Checkable Proofs and NP-Hard Optimization Problems.
Most Helpful Customer Reviews
It is so unfortunate for me to use this book as a text. It is dense and hard to follow, without examples and explanations. Maybe it is good for experts, but I am sure it is not good for beginners.