ISBN-10:
0471345067
ISBN-13:
9780471345060
Pub. Date:
01/27/2000
Publisher:
Wiley
Theory of Computational Complexity / Edition 1

Theory of Computational Complexity / Edition 1

Hardcover

Current price is , Original price is $202.0. You

Temporarily Out of Stock Online

Please check back later for updated availability.

This item is available online through Marketplace sellers.

Product Details

ISBN-13: 9780471345060
Publisher: Wiley
Publication date: 01/27/2000
Series: Wiley Series in Discrete Mathematics and Optimization Series , #58
Pages: 512
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

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.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews

Theory of Computational Complexity 2 out of 5 based on 0 ratings. 1 reviews.
Guest More than 1 year ago
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.