|
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) | 
 enlarge | Authors: M. R. Garey, D. S. Johnson
Publisher: W. H. Freeman
Category: Book
Buy New: $60.07
New (18) Used (11) from $42.67
Rating:  13 reviews
Sales Rank: 62485
Media: Paperback
Pages: 340
Number Of Items: 1
Shipping Weight (lbs): 1.1
Dimensions (in): 9.1 x 6.5 x 0.7
ISBN: 0716710455
Dewey Decimal Number: 519.4
EAN: 9780716710455
Publication Date: January 15, 1979
Availability: Usually ships in 24 hours
| |
| Also Available In:
|
| Similar Items:
|
| Editorial Reviews:
Amazon.com Review
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.
|
| Customer Reviews: Read 8 more reviews...
 Definitely a classic but not good for beginners October 24, 2007
Jasper Zhang (Philadelphia, USA)
I have to say that this is a true classic. It gives a very nice treatment of what is NP-completeness in a fashion that really defends the topic well. It gives nice illustrations to show different situations and how to deal with it. But after the first couple of chapters it does get a little out there with the proofs it does. It is still approachable, but it assumes that the reader is already familiar with the basics of combinatorial complexity, especially in reductions. I would only recommend this book to readers who has gone through such books as Introduction to Algorithms by Cormen et al. or Combinatorial Complexity by Papadimitriou and Steiglitz. Those two books are more for beginners and this book should be one to help anyone interested in NP-complete problems to get more practice and depth understanding. Overall a great book for anyone interested in the topic. The grand challenge is to reduce everything to at least something within the 150 problems listed on your own.
comprehensive book for NP-completeness September 21, 2007
S. SHEN (Gainesville, FL USA)
The book is excellent in explaining NP-completeness problem. Take it as a reference if you would like to do research in this field.
Published in 1979 and still the best June 16, 2007
F. Guerin
This is a rare example of a textbook where the authors actually go to the trouble of considering the fact that the intended reader is a non-expert. Published in 1979 and still the best.
Arrived in time, good condition February 24, 2006
Mohamed El Wakil (Kalamazoo, USA)
0 out of 38 found this review helpful
The book arrived in time, in good condition, and adequate packing.
A Beautiful Book on a Beautiful Subject December 10, 2005
Reader
1 out of 15 found this review helpful
This is among the most eloquently written books that I have ever read in my life. Highly recommended.
|
|
|
. | |