|
|
"Ding-Zhu Du, Ker-I Ko" ListingsIf you cannot find what you want on this page, then please use our search feature to search all our listings. Click on Title to view full description
|
|
|
1 |
"Ding-Zhu Du, Ker-I Ko" Theory of Computational Complexity
Wiley-Interscience 2000 0471345067 / 9780471345060 Hardcover New
"Brand New clean, tight, unmarked, (Fine)() 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 proo ID: mon0000093665"
Price:
125.84 USD
|
|
Add to Shopping Cart |
|
|
|
