Skip to content

Theory of Computational Complexity

Spend $50 to get a free DVD!

ISBN-10: 0471345067

ISBN-13: 9780471345060

Edition: 2000

Authors: Ding-Zhu Du, Ker-I Ko

List price: $202.00
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

Computational complexity theory is covered comprehensively in this reference work which contains a complete treatment of the field, including major topics such as Turing-machine based complexity theory. Recent breakthroughs in this field are featured.
Customers also bought

Book details

List price: $202.00
Copyright year: 2000
Publisher: John Wiley & Sons, Incorporated
Publication date: 1/27/2000
Binding: Hardcover
Pages: 512
Size: 6.50" wide x 10.00" long x 1.00" tall
Weight: 1.892
Language: English

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 andNP-Hard Optimization Problems
Bibliography
Index