Search  About  Preferences  Interact  Help  
150 million books. 1 search engine. 
Founded in 1997, BookFinder.com has become a leading book price comparison site:
Find and compare hundreds of millions of new books, used books, rare books and out of print books from over 100,000 booksellers and 60+ websites worldwide.
Computers and Intractability:

This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, "I can't find an efficient algorithm, but neither can all these famous people." This man illustrates an important quality of a class of problems, namely, the NPcomplete problems: if you can prove that a problem is in this class, then it has no known polynomialtime solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.
The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NPcomplete 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 NPcomplete and how to cope with NPcomplete problems. (There is even a chapter on advanced topics, with numerous references.) Computers and Intractability also contains a list of more than 300 problemsmost of which are known to be NPcompletewith comments and references. [via]