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.
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.
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 "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 4,55 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiEUR 29,90 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Condizione: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Codice articolo Z1-U-017-02118
Quantità: 1 disponibili
Da: Milbury Books, New Romney, Regno Unito
Hardcover. Condizione: Near Fine. 491pp. A Near Fine copy with pristine text, no inscriptions or labels, no wear to binding and glazed board covers displaying just light surface wear only. Please see five pictures attached. Codice articolo ABE-1718706032116
Quantità: 1 disponibili
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Hardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.9. Codice articolo G0471345067I4N00
Quantità: 1 disponibili
Da: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Hardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.9. Codice articolo G0471345067I4N00
Quantità: 1 disponibili
Da: Lily of the Valley Books, Waynesboro, VA, U.S.A.
Hardcover. Condizione: Very Good. No Jacket. Book is gently used with only minor wear. Tightly bound copy with clean interior having no markings, writing, underlining, or highlighting in margins or text block. Inv. # 10143. Codice articolo 010143
Quantità: 1 disponibili
Da: Antiquariat Bernhardt, Kassel, Germania
gebundene Ausgabe. Condizione: Sehr gut. Zust: Gutes Exemplar. Mit Vorbesitzereintrag. XIII, 491 Seiten, Englisch 848g. Codice articolo 492494
Quantità: 1 disponibili
Da: J. Wyatt Books, Ottawa, ON, Canada
Hardcover. Condizione: Near Fine. 491 pages in excellent condition. Green, glossy hardcovers with grey titles. Almost no wear. NEAR FINE. Book. Codice articolo 216358
Quantità: 1 disponibili
Da: HPB-Red, Dallas, TX, U.S.A.
hardcover. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Codice articolo S_381742280
Quantità: 1 disponibili
Da: Naymis Academic - EXPEDITED SHIPPING AVAILABLE, Princeton, TX, U.S.A.
Hardcover. Condizione: New. 1st Edition. NEW BOOK. Codice articolo 002440
Quantità: 1 disponibili
Da: BennettBooksLtd, North Las Vegas, NV, U.S.A.
Hardcover. Condizione: New. In shrink wrap. Looks like an interesting title! Codice articolo Q-0471345067
Quantità: 1 disponibili