Wiley
Wiley.com
Print this page Share

Theory of Computational Complexity

ISBN: 978-0-471-34506-0
512 pages
January 2000
Theory of Computational Complexity (0471345067) cover image
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.
See More
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.
See More
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.
See More
"Here one finds both a basic introduction and comprehensive treatments, especially of topics that have borne spectacular fruit in just the last few years..." (Choice, Vol. 38, No. 10, June 2001)

"Graduate students in this area of computer science will simply find htis book indispensable." (CHOICE, June 2001)

"Du and Ko present the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization..." (SciTech Book News, Vol. 24, No. 4, December 2000)

Overall, I would recommend this book as an excellent addition to the literature. (Bulleting of the London Mathematical Society, Volume 33, 2001)

"The book...is a graduate text...however, it can also be used profitably by researchers in theory...the selection by the authors of the book under review is excellent." (Mathematical Reviews, Issue 2001k)

Excerpt from publisher's description: "...promises to become the standard reference on computational complexity." (Zentralblatt MATH, Vol. 963, 2001/13)

"the book promises to become the standard reference on computational complexity" (Zentralblatt MATH, Vol.963, No.13 2001)
See More

Related Titles

Back to Top