AnyBook4Less.com	Find the Best Price on the Web Order from a Major Online Bookstore
Home  |  Store List  |  FAQ  |  Contact Us  |
Ultimate Book Price Comparison Engine Save Your Time And Money Keyword AuthorISBN

Title: Computers and Intractability: A Guide to the Theory of Np-Completeness (Series of Books in the Mathematical Sciences) by Michael R. Garey, David S. Johnson ISBN: 0-7167-1045-5 Publisher: W H Freeman & Co. Pub. Date: June, 1979 Format: Paperback Volumes: 1 List Price(USD): $41.26

Your Country USA Canada United Kingdom Australia Austria Belgium France Germany Italy Netherlands Switzerland Currency AutoUSD CAD GBP EUR AUD CHF Delivery Only cheapest delivery All delivery options Include Used Books Are you a club member of: Barnes and Noble Books A Million Chapters.Indigo.ca

Average Customer Rating: 4.86 (7 reviews)

Rating: 5
Summary: The most readable math book ever
Comment: 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.

Rating: 4
Summary: Showing its age
Comment: 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.

Rating: 5
Summary: A classic!
Comment: 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.

Similar Books:

	Title: Combinatorial Optimization : Algorithms and Complexity by Christos H. Papadimitriou, Kenneth Steiglitz ISBN: 0486402584 Publisher: Dover Pubns Pub. Date: July, 1998 List Price(USD): $18.95
	Title: Computational Complexity by Christos H. Papadimitriou ISBN: 0201530821 Publisher: Addison-Wesley Pub Co Pub. Date: January, 1994 List Price(USD): $61.00
	Title: Introduction to the Theory of Computation by Michael Sipser ISBN: 053494728X Publisher: Brooks Cole Pub. Date: 13 December, 1996 List Price(USD): $101.95
	Title: Approximation Algorithms by Vijay V. Vazirani ISBN: 3540653678 Publisher: Springer Verlag Pub. Date: 09 August, 2001 List Price(USD): $39.95
	Title: Introduction to Algorithms, Second Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein ISBN: 0262032937 Publisher: MIT Press Pub. Date: 01 September, 2001 List Price(USD): $79.95