Computers & Intractability: Amazon.ca: Michael R, and Johnson, David S, and Johnson, D S Garey: Books

Tag this product

Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.

Customer Reviews

7 Reviews

5 star:		(6)
4 star:		(1)
3 star:		(0)
2 star:		(0)
1 star:		(0)

Average Customer Review

4.9 out of 5 stars (7 customer reviews)

Share your thoughts with other customers:

Create your own review

Most helpful customer reviews

5.0 out of 5 stars The most readable math book ever, April 24 2003

By

Carolyn P. Meinel (Cedar Crest, NM United States) - See all my reviews
(REAL NAME)

This review is from: Computers & Intractability (Paperback)

I first read this book while researching heuristic techniques for reaching "good enough" solutions to the Travelling Salesman problem. "Computers and Intractability" was a breath of fresh air. It was as rigorous as any mathematical treatise, but written in a way that even a non-math major could understand. If you ever want to know why computers are so buggy, you'll know the mathematical reason for this within the first few pages of this book. By the time you reach the end, you'll never trust cryptography to absolutely, without a doubt, keep data secure for long, if at all.

Help other customers find the most helpful reviews

Was this review helpful to you? Yes No

Report abuse

4.0 out of 5 stars Showing its age, Dec 3 2001

By A Customer

This review is from: Computers & Intractability (Paperback)

Yes, it's a classic. Yes, every computer scientist MUST own it. But enormous significant progress has been made in the field of NP-completeness (and computational complexity more generally) in the two decades since this book was published. An up-to-date edition -- which would probably be well over a thousand pages long -- has been badly needed for years.

Help other customers find the most helpful reviews

Was this review helpful to you? Yes No

Report abuse

5.0 out of 5 stars A classic!, Sep 14 2000

By

Todd Ebert (Long Beach California) - See all my reviews

This review is from: Computers & Intractability (Paperback)

I think every computer science student should read some of this book to learn about complexity theory and the notions reducibilty and completeness. Moreover, you may come across a problem that you have to show is NP or P complete, and the examples in the book provide a good model for doing so. Papadimitriou's book on complexity is also a great place to learn more about the subject.

Help other customers find the most helpful reviews

Was this review helpful to you? Yes No

Report abuse

Share your thoughts with other customers: Create your own review

› See all 7 customer reviews on Amazon.ca

Want to see more reviews on this item?

› Go to Amazon.com to see all 13 reviews 4.8 out of 5 stars

Most recent customer reviews

5.0 out of 5 stars Contemplating Abstract Thought
Every graduate CS student will probably encounter this book--it is a classic.

But long after that course in NP theory was over, the astonishment of a different aspect of the... Read more

Published on April 29 2000 by S. Wuest

5.0 out of 5 stars Required reference
Absolutely required text. The introductory material is useful, but I must admit I've found other texts easier for that (I like Sipser's book). Read more