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 ...
Read More
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.
Read Less
Add this copy of Computational Complexity to cart. $20.28, fair condition, Sold by ZBK Books rated 4.0 out of 5 stars, ships from Woodland Park, NJ, UNITED STATES, published 1993 by Pearson.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fair. May contain writing notes highlighting bends or folds. Text is readable book is clean and pages and cover mostly intact. May show normal wear and tear. Item may be missing CD. May include library marks.
Add this copy of Computational Complexity to cart. $20.91, fair condition, Sold by ThriftBooks-Baltimore rated 4.0 out of 5 stars, ships from Halethorpe, MD, UNITED STATES, published 1993 by Pearson.
Add this copy of Computational Complexity to cart. $20.94, good condition, Sold by Friends Tucson rated 5.0 out of 5 stars, ships from Tucson, AZ, UNITED STATES, published 1993 by Pearson.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Hardcover. NOT Ex-library. This item is in good condition. May show moderate signs of use. Addison-Wesley is an imprint of Pearson. Proceeds benefit the Pima County Public Library system, which serves Tucson and southern Arizona. Until further notice, USPS Priority Mail only reliable option for Hawaii.
Add this copy of Computational Complexity to cart. $32.41, fair condition, Sold by Dream Books Co. rated 5.0 out of 5 stars, ships from Denver, CO, UNITED STATES, published 1993 by Pearson.
Add this copy of Computational Complexity to cart. $93.05, good condition, Sold by TEXTSHUB rated 5.0 out of 5 stars, ships from Franklin Lakes, NJ, UNITED STATES, published 1993 by Pearson.
Add this copy of Computational Complexity to cart. $94.39, good condition, Sold by Book Words rated 3.0 out of 5 stars, ships from Midland Park, NJ, UNITED STATES, published 1993 by Pearson.
Add this copy of Computational Complexity to cart. $94.90, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 1993 by Pearson.
Add this copy of Computational Complexity to cart. $99.43, new condition, Sold by GridFreed rated 4.0 out of 5 stars, ships from North Las Vegas, NV, UNITED STATES, published 1993 by Pearson.
Add this copy of Computational Complexity to cart. $148.64, very good condition, Sold by Book Words rated 3.0 out of 5 stars, ships from Midland Park, NJ, UNITED STATES, published 1993 by Pearson.
