Theory of Computational Complexity
Description:
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.
Best prices to buy, sell, or rent ISBN 9780471345060
Frequently Asked Questions about Theory of Computational Complexity
The price for the book starts from $41.77 on Amazon and is available from 7 sellers at the moment.
If you’re interested in selling back the Theory of Computational Complexity book, you can always look up BookScouter for the best deal. BookScouter checks 30+ buyback vendors with a single search and gives you actual information on buyback pricing instantly.
As for the Theory of Computational Complexity book, the best buyback offer comes from and is $ for the book in good condition.
The Theory of Computational Complexity book is in very low demand now as the rank for the book is 6,956,974 at the moment. A rank of 1,000,000 means the last copy sold approximately a month ago.
Not enough insights yet.