Verwandte Artikel zu Theory of Computational Complexity (Wiley Series in...
Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) - Hardcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
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.
Von der hinteren Coverseite
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 37,43
EUR 4,50 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 97,06
EUR 30,01 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Theory of Computational Complexity (Wiley Series in...
Beispielbild für diese ISBN
Theory of Computational Complexity
Anbieter: Phatpocket Limited, Waltham Abbey, HERTS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers Z1-U-017-02118
Anzahl: 1 verfügbar
Foto des Verkäufers
Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)
Anbieter: Milbury Books, New Romney, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers ABE-1718706032116
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Theory of Computational Complexity
Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.9. Bestandsnummer des Verkäufers G0471345067I4N00
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Theory of Computational Complexity
Anbieter: ThriftBooks-Dallas, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.9. Bestandsnummer des Verkäufers G0471345067I4N00
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Theory of Computational Complexity (Wiley-Interscience Series in Discrete Mathematics and Optimization).
Verlag:
John Wiley & Sons, Inc., 2000
ISBN 10: 0471345067
ISBN 13: 9780471345060
Gebraucht
Hardcover
Anbieter: Antiquariat Bernhardt, Kassel, Deutschland
Verkäuferbewertung 5 von 5 Sternen
gebundene Ausgabe. Zustand: Sehr gut. Zust: Gutes Exemplar. Mit Vorbesitzereintrag. XIII, 491 Seiten, Englisch 848g. Bestandsnummer des Verkäufers 492494
Anzahl: 1 verfügbar
Foto des Verkäufers
Theory of Computational Complexity
Verlag:
John Wiley & Sons, New York, NY, 2000
ISBN 10: 0471345067
ISBN 13: 9780471345060
Gebraucht
Hardcover
Anbieter: Lily of the Valley Books, Waynesboro, VA, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers 010143
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
THEORY OF COMPUTATIONAL COMPLEXITY
Verlag:
John Wiley & Sons, New York, 2000
ISBN 10: 0471345067
ISBN 13: 9780471345060
Gebraucht
Hardcover
Anbieter: J. Wyatt Books, Ottawa, ON, Kanada
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Near Fine. 491 pages in excellent condition. Green, glossy hardcovers with grey titles. Almost no wear. NEAR FINE. Book. Bestandsnummer des Verkäufers 216358
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Theory of Computational Complexity - 9780471345060 - NEW
Verlag:
Wiley-Interscience, 2000
ISBN 10: 0471345067
ISBN 13: 9780471345060
Neu
Hardcover
Erstausgabe
Anbieter: Naymis Academic - EXPEDITED SHIPPING AVAILABLE, Princeton, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: New. 1st Edition. NEW BOOK. Bestandsnummer des Verkäufers 002440
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Theory of Computational Complexity
Anbieter: HPB-Red, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
hardcover. Zustand: 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! Bestandsnummer des Verkäufers S_381742280
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Theory of Computational Complexity
Anbieter: BennettBooksLtd, North Las Vegas, NV, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: New. In shrink wrap. Looks like an interesting title! Bestandsnummer des Verkäufers Q-0471345067
Anzahl: 1 verfügbar