Quantity:

More Buying Choices

25 used & new from �19.99

Have one to sell? Sell yours here

Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences)

See larger image

Share your own customer images

Publisher: learn how customers can search inside this book.

Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences) (Paperback)

by Michael R. Garey (Author), David S. Johnson (Author)

5.0 out of 5 stars See all reviews (1 customer review)

RRP:	�43.99
Price:	�39.18 & this item Delivered FREE in the UK with Super Saver Delivery. See details and conditions
You Save:	�4.81 (11%)
	o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

In stock.
Dispatched from and sold by Amazon.co.uk. Gift-wrap available.

Only 2 left in stock--order soon (more on the way).

Want guaranteed delivery by Tuesday, November 17? Choose Express delivery at checkout. See Details

16 new from �37.38 9 used from �19.99

Other Editions:	RRP:	Our Price:	Other Offers:
Hardcover			2 used & new from �80.00
Unknown Binding			Order it used

Frequently Bought Together

Customers Who Bought This Item Also Bought

Computational Complexity

by Christos H. Papadimitriou

4.5 out of 5 stars (2)

Combinatorial Optimization: Algorithms and Complexity

by Christos H. Papadimitriou

5.0 out of 5 stars (2) �10.74

Computational Complexity: A Modern Approach

by Sanjeev Arora

�26.09

The Code Book: The Secret History of Codes and Code-breaking

by Simon Singh

4.8 out of 5 stars (77) �5.98

An Introduction to Godel's Theorems (Cambridge Introductions to Philosophy)

by Peter Smith

5.0 out of 5 stars (1) �14.19

› Explore similar items

Product details

Paperback: 340 pages
Publisher: W.H.Freeman & Co Ltd (26 April 1979)
Language English
ISBN-10: 0716710455
ISBN-13: 978-0716710455
Product Dimensions: 23.1 x 16.5 x 1.8 cm

Average Customer Review: 5.0 out of 5 stars See all reviews (1 customer review)

Amazon.co.uk Sales Rank: 195,083 in Books (See Bestsellers in Books)

Would you like to update product info or give feedback on images?

Tags Customers Associate with This Product

(What's this?)

Click on a tag to find related items, discussions, and people.

intractability(1)

What Do Customers Ultimately Buy After Viewing This Item?

	85% buy the item featured on this page: Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences) 5.0 out of 5 stars (1) �39.18
	15% buy Combinatorial Optimization: Algorithms and Complexity 5.0 out of 5 stars (2) �10.74

Explore similar items

Customer Reviews

1 Review

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

Average Customer Review

5.0 out of 5 stars (1 customer review)

Share your thoughts with other customers:

Create your own review

Most Helpful Customer Reviews

22 of 22 people found the following review helpful:

5.0 out of 5 stars On the difficulty of computers to deal with certain problems, 16 April 1997

By A Customer

All those who deals with Computer Science, Mathematics and Engineering have to face the reality that certain problems seem really hard to solve. Even with the more sophisticated, and technologically advanced among the currently available computers---and among those that are to come in the next several years---, it seems highly likely that we cannot efficiently solve certain specific problems.

A first well written and systematic account on the hardness of this problems is the 1979 book on the theory of NP completeness by Michael R. Garey and David S. Johnson: Computers and Intractability, A Guide to the Theory of NP-Completeness (W.H. Freeman and Company, San Francisco). It is amazing how, after all these years, this book remains a fundamental one to be introduced on what can be effectively and efficiently solved by computers and above all on what it seems not efficiently solvable, independently of the advances of technology. Other texts have been published after that one, as for example the recent clear and complete overview on what has been done and extensively researched since then that has been given by Christos H. Papadimitriou in his book Computational Complexity (Addison-Wesley, 1994). Nevertheless, the Garey-Johnson book---as it is often familiarly called---remains the fundamental book for a clear introduction to this central problem of what is tractable by computers.

Starting from a very clear introduction to the technical term "NP-Complete," and to how this term gained importance for the description of the algorithmic tractability of certain problems in the early 70s, the book clearly defines, both in an intuitive and then in a formal way, what it is meant by the complexity of a problem. More than that, this complexity is directly related to the effective methods for solving problems (algorithms) and thus to computers themselves. The basic of the theory of NP-Completeness is completely covered in the first 5 chapters, beginning from a low-level introduction to some of the central notions of computational complexity and finally providing detailed definitions describing proof techniques to prove the hardness of certain problems. The remaining two chapters provide an overview on two alternative directions for further study. (The both of them have been extensively investigated in the following years.) Finally, the appendix contains more than 300 main entries on NP-Complete and NP-Hard problems, and this last part of the book is continuously referenced in journal and conference papers on the subject.

The first chapter is definitely accessible also to those that doesn't know so much mathematics, or computers related stuff, and thus the book is recommendable to those that are simply curious about the things that can be solved with computers.

Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)

Share your thoughts with other customers: Create your own review

› See all customer reviews...

.jsOffDisplayBlock { display: block; } .jsOffDisplayInline { display: inline; } .jsOffVisibility { visibility: visible; } .jsOnDisplayBlock { display: none; } .jsOnDisplayNoneBlock { display: block; } .jsOnDisplayNoneInline { display: inline; } .jsOnDisplayInline { display: none; } .jsOnVisibility { visibility: hidden; } .jqOnDisplayBlock { display: none; } .jqOnDisplayInline { display: none; } .jqOnVisibility { visibility: hidden; } .jqOnDisplayNoneBlock { display: block; } .jqOnDisplayNoneInline { display: inline; }