Articles liés à Theory of Computational Complexity
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 97,12
EUR 4,29 expédition vers Etats-Unis
Destinations, frais et délaisRésultats de recherche pour Theory of Computational Complexity
Image d'archives
Theory of Computational Complexity
Edité par
Wiley-Interscience, 2000
ISBN 10 : 0471345067
ISBN 13 : 9780471345060
Ancien ou d'occasion
Couverture rigide
Vendeur : HPB-Red, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
hardcover. Etat : 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! N° de réf. du vendeur S_381742280
Quantité disponible : 1 disponible(s)
Image d'archives
Theory of Computational Complexity
Edité par
Wiley-Interscience, 2000
ISBN 10 : 0471345067
ISBN 13 : 9780471345060
Ancien ou d'occasion
Couverture rigide
Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur Z1-U-017-02118
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)
Edité par
John Wiley, 2000
ISBN 10 : 0471345067
ISBN 13 : 9780471345060
Ancien ou d'occasion
Couverture rigide
Vendeur : Milbury Books, New Romney, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : 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. N° de réf. du vendeur ABE-1718706032116
Quantité disponible : 1 disponible(s)
Image d'archives
THEORY OF COMPUTATIONAL COMPLEXITY
Edité par
John Wiley & Sons, New York, 2000
ISBN 10 : 0471345067
ISBN 13 : 9780471345060
Ancien ou d'occasion
Couverture rigide
Vendeur : J. Wyatt Books, Ottawa, ON, Canada
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Near Fine. 491 pages in excellent condition. Green, glossy hardcovers with grey titles. Almost no wear. NEAR FINE. Book. N° de réf. du vendeur 216358
Quantité disponible : 1 disponible(s)
Image d'archives
Theory of Computational Complexity - 9780471345060 - NEW
Edité par
Wiley-Interscience, 2000
ISBN 10 : 0471345067
ISBN 13 : 9780471345060
Neuf
Couverture rigide
Edition originale
Vendeur : Naymis Academic - EXPEDITED SHIPPING AVAILABLE, Princeton, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : New. 1st Edition. NEW BOOK. N° de réf. du vendeur 002440
Quantité disponible : 1 disponible(s)
Image d'archives
Theory of Computational Complexity (Wiley-Interscience Series in Discrete Mathematics and Optimization).
Edité par
John Wiley & Sons, Inc., 2000
ISBN 10 : 0471345067
ISBN 13 : 9780471345060
Ancien ou d'occasion
Couverture rigide
Vendeur : Antiquariat Bernhardt, Kassel, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
gebundene Ausgabe. Etat : Sehr gut. Zust: Gutes Exemplar. Mit Vorbesitzereintrag. XIII, 491 Seiten, Englisch 848g. N° de réf. du vendeur 492494
Quantité disponible : 1 disponible(s)
Image d'archives
Theory of Computational Complexity
Edité par
Wiley-Interscience, 2000
ISBN 10 : 0471345067
ISBN 13 : 9780471345060
Neuf
Couverture rigide
Vendeur : BennettBooksLtd, San Diego, NV, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : New. In shrink wrap. Looks like an interesting title! N° de réf. du vendeur Q-0471345067
Quantité disponible : 1 disponible(s)