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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Descrizione libro Wiley-Interscience. Condizione libro: New. 0471345067 NEW US Edition COLLEGE TEXTBOOK - WE DO NOT SHIP TO AK OR HI - If you have any specific needs please contact us through the appropriate marketplace. We ship all orders within 1 business day. Codice libro della libreria 0138819
Descrizione libro Condizione libro: Brand New. Book Condition: Brand New. Codice libro della libreria 97804713450601.0
Descrizione libro Wiley-Interscience, 2000. Condizione libro: New. Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: UNIFORM COMPLEXITY.Models of Computation and Complexity Classes.NP-Completeness.The Polynomial-Time Hierarchy and Polynomial Space.Structure ofNP.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. Codice libro della libreria ABE_book_new_0471345067
Descrizione libro Wiley-Interscience, 2000. Hardcover. Condizione libro: New. Codice libro della libreria P110471345067
Descrizione libro Wiley-Interscience, 2000. Hardcover. Condizione libro: New. book. Codice libro della libreria 0471345067