Computational Complexity

3.73 avg rating
( 78 ratings by GoodReads )
 
9780020153085: Computational Complexity

This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others. Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics and probability.

"synopsis" may belong to another edition of this title.

Buy Used View Book
List Price: US$ 509.60
US$ 273.64

Convert Currency

Shipping: US$ 4.99
Within U.S.A.

Destination, Rates & Speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Papadimitriou, Christos, H.
Published by Addison-Wesley Pub Co (1994)
ISBN 10: 0020153082 ISBN 13: 9780020153085
Used Hardcover Quantity Available: 1
Seller
Books Express
(Portsmouth, NH, U.S.A.)
Rating
[?]

Book Description Addison-Wesley Pub Co, 1994. Hardcover. Book Condition: Used: Good. We ship International with Tracking Number! May not contain Access Codes or Supplements. Buy with confidence, excellent customer service! L. Bookseller Inventory # 0020153082D

More Information About This Seller | Ask Bookseller a Question

Buy Used
US$ 273.64
Convert Currency

Add to Basket

Shipping: US$ 4.99
Within U.S.A.
Destination, Rates & Speeds