Items related to Theory of Computational Complexity (Wiley Series in...
Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) - Hardcover
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.
"synopsis" may belong to another edition of this title.
About the Author
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.
From the Back Cover
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.
"About this title" may belong to another edition of this title.
Buy New
View this item
£ 84.17
£ 26.02 shipping from U.S.A. to United Kingdom
Destination, rates & speedsSearch results for Theory of Computational Complexity (Wiley Series in...
Seller Image
Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)
Seller: Milbury Books, New Romney, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: 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. Seller Inventory # ABE-1718706032116
Quantity: 1 available
Stock Image
Theory of Computational Complexity
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # Z1-U-017-02118
Quantity: 1 available
Stock Image
Theory of Computational Complexity
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.9. Seller Inventory # G0471345067I4N00
Quantity: 1 available
Stock Image
Theory of Computational Complexity
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.9. Seller Inventory # G0471345067I4N00
Quantity: 1 available
Seller Image
Theory of Computational Complexity
Published by
John Wiley & Sons, New York, NY, 2000
ISBN 10: 0471345067
ISBN 13: 9780471345060
Used
Hardcover
Seller: Lily of the Valley Books, Waynesboro, VA, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: 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. Seller Inventory # 010143
Quantity: 1 available
Stock Image
THEORY OF COMPUTATIONAL COMPLEXITY
Published by
John Wiley & Sons, New York, 2000
ISBN 10: 0471345067
ISBN 13: 9780471345060
Used
Hardcover
Seller: J. Wyatt Books, Ottawa, ON, Canada
Seller rating 5 out of 5 stars
Hardcover. Condition: Near Fine. 491 pages in excellent condition. Green, glossy hardcovers with grey titles. Almost no wear. NEAR FINE. Book. Seller Inventory # 216358
Quantity: 1 available
Stock Image
Theory of Computational Complexity (Wiley-Interscience Series in Discrete Mathematics and Optimization).
Published by
John Wiley & Sons, Inc., 2000
ISBN 10: 0471345067
ISBN 13: 9780471345060
Used
Hardcover
Seller: Antiquariat Bernhardt, Kassel, Germany
Seller rating 5 out of 5 stars
gebundene Ausgabe. Condition: Sehr gut. Zust: Gutes Exemplar. Mit Vorbesitzereintrag. XIII, 491 Seiten, Englisch 848g. Seller Inventory # 492494
Quantity: 1 available
Stock Image
Theory of Computational Complexity - 9780471345060 - NEW
Published by
Wiley-Interscience, 2000
ISBN 10: 0471345067
ISBN 13: 9780471345060
New
Hardcover
First Edition
Seller: Naymis Academic - EXPEDITED SHIPPING AVAILABLE, Princeton, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: New. 1st Edition. NEW BOOK. Seller Inventory # 002440
Quantity: 1 available
Stock Image
Theory of Computational Complexity
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: 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! Seller Inventory # S_381742280
Quantity: 1 available
Stock Image
Theory of Computational Complexity
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0471345067
Quantity: 1 available