A readable, straightforward guide by two authors with extensive experience in the field This text shows how to recognize NP complete problems and offers practical suggestions for dealing with them effectively It is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity....
|Title||:||Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)|
|Number of Pages||:||278 Pages|
|File Size||:||765 KB|
|Status||:||Available For Download|
|Last checked||:||21 Minutes ago!|
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Reviews
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.
A bit of a tough read. Have pencil and paper ready, but well worth the effort. Requires some abstract math background to make sense of it.
Not for the soft at heart, but gives a good explanation of the NP world...
This book is photocopy, not a original book. Donot buy it.
I bought this text at the suggestion of my professor. This is a challenging book but very well written and a great resource for understanding the theory with plenty of examples.
This is a must have for every student of computer science.
The book is excellent in explaining NP-completeness problem. Take it as a reference if you would like to do research in this field.