Enjoy fast, FREE delivery, exclusive deals and award-winning movies & TV shows with Prime
Try Prime
and start saving today with Fast, FREE Delivery
Amazon Prime includes:
Fast, FREE Delivery is available to Prime members. To join, select "Try Amazon Prime and start saving today with Fast, FREE Delivery" below the Add to Cart button.
Amazon Prime members enjoy:- Cardmembers earn 5% Back at Amazon.com with a Prime Credit Card.
- Unlimited Free Two-Day Delivery
- Instant streaming of thousands of movies and TV episodes with Prime Video
- A Kindle book to borrow for free each month - with no due dates
- Listen to over 2 million songs and hundreds of playlists
- Unlimited photo storage with anywhere access
Important: Your credit card will NOT be charged when you start your free trial or if you cancel during the trial period. If you're happy with Amazon Prime, do nothing. At the end of the free trial, your membership will automatically upgrade to a monthly membership.
Buy new:
$148.00$148.00
FREE delivery:
Sunday, July 16
Ships from: Amazon Sold by: SuccessTextBook
Buy used: $61.00
Other Sellers on Amazon
& FREE Shipping
88% positive over last 12 months
Usually ships within 2 to 3 days.
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required. Learn more
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Follow the Authors
OK
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) First Edition
| Price | New from | Used from |
Purchase options and add-ons
- ISBN-100716710455
- ISBN-13978-0716710455
- EditionFirst Edition
- PublisherW. H. Freeman
- Publication dateJanuary 15, 1979
- LanguageEnglish
- Dimensions6.14 x 0.74 x 9.21 inches
- Print length340 pages
Frequently bought together

What do customers buy after viewing this item?
- Most purchased | Highest ratedin this set of products
Introduction to Algorithms, 3rd Edition (The MIT Press)Hardcover
Editorial Reviews
Amazon.com Review
The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; Computers and Intractability does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) Computers and Intractability also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.
Product details
- Publisher : W. H. Freeman; First Edition (January 15, 1979)
- Language : English
- Paperback : 340 pages
- ISBN-10 : 0716710455
- ISBN-13 : 978-0716710455
- Item Weight : 1.19 pounds
- Dimensions : 6.14 x 0.74 x 9.21 inches
- Best Sellers Rank: #531,513 in Books (See Top 100 in Books)
- #6 in Device Drivers
- #587 in Microsoft Programming (Books)
- #1,523 in Applied Mathematics (Books)
- Customer Reviews:
About the authors

Discover more of the author’s books, see similar authors, read author blogs and more

Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on AmazonReviewed in the United States on November 24, 2022
-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
Top reviews from other countries
今では,Sipser『計算理論の基礎』(共立出版)やMoore, Mertens 『The Nature of Computation』など新しくてよりわかりやすい本が出ており,初学者にはこちらを勧めたい.
It's out of date (there are lots of other problems that have been proved to be NP-complete since it was written) but it's a invaluable resource and will be in the reference list for any work on the topic.
I'm studying it now.







