Editorial Reviews
Amazon.com
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 NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time 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 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.
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences),M. R. Garey,D. S. Johnson,W. H. Freeman,0716710455,Applied,Computational complexity,Computer Bks - Languages / Programming,Computer Science,Computer algorithms,Computer programming,Computers - Languages / Programming,Programming - General,Science/Mathematics,Mathematical theory of computation,Mathematics / General
Books Review:
Recommended Books