Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) 1st Edition
Use the Amazon App to scan ISBNs and compare prices.
"Devoted" by Dean Koontz
For the first time in paperback, from Dean Koontz, the master of suspense, comes an epic thriller about a terrifying killer and the singular compassion it will take to defeat him. | Learn more
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
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.
- Paperback : 340 pages
- ISBN-10 : 0716710455
- ISBN-13 : 978-0716710455
- Item Weight : 1.19 pounds
- Product Dimensions : 6.14 x 0.74 x 9.21 inches
- Publisher : W. H. Freeman; 1st Edition (January 15, 1979)
- Language: : English
- Best Sellers Rank: #514,203 in Books (See Top 100 in Books)
- Customer Reviews:
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
Top reviews from other countries
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.