Join Amazon Prime and get unlimited Free One-Day Delivery. Already a member? Sign in.

 

or
Sign in to turn on 1-Click ordering.
 
   
More Buying Choices
26 used & new from £26.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
 

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)
Price: £43.99 & this item Delivered FREE in the UK with Super Saver Delivery. See details and conditions
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 1 left in stock--order soon (more on the way).

Want guaranteed delivery by Saturday, July 11? Choose Express delivery at checkout. See Details
15 new from £34.12 11 used from £26.99
Other Editions: RRP: Our Price: Other Offers:
Hardcover 2 used & new from £80.00
Unknown Binding Order it used

Frequently Bought Together

Customers buy this book with Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou

Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences) + Combinatorial Optimization: Algorithms and Complexity
Price For Both: £58.48

Show availability and shipping details


Customers Who Bought This Item Also Bought

Combinatorial Optimization: Algorithms and Complexity

Combinatorial Optimization: Algorithms and Complexity

by Christos H. Papadimitriou
5.0 out of 5 stars (2)  £14.49
Computational Complexity

Computational Complexity

by Christos H. Papadimitriou
An Introduction to Godel's Theorems (Cambridge Introductions to Philosophy)

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

by Peter Smith
5.0 out of 5 stars (1)  £15.19
Algorithmic Game Theory

Algorithmic Game Theory

by Noam Nisan
£29.57
Axiomatic Set Theory

Axiomatic Set Theory

by Patrick Suppes
£10.99
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: 49,448 in Books (See Bestsellers in Books)

    Popular in this category:

    #34 in  Books > Computing & Internet > Computer Science > Algorithms

Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
Check the boxes next to the tags you consider relevant or enter your own tags in the field below

Your tags: Add your first tag
 

What Do Customers Ultimately Buy After Viewing This Item?

Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences)
92% 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)
£43.99
Combinatorial Optimization: Algorithms and Complexity
8% buy
Combinatorial Optimization: Algorithms and Complexity 5.0 out of 5 stars (2)
£14.49

 

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:
Most Helpful Customer Reviews

 
21 of 21 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
 
 
 
Only search this product's reviews



Customer Discussions

 Beta (What's this?)
This product's forum (0 discussions)
  Discussion Replies Latest Post
  No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
  [Cancel]

   


Listmania!


Look for similar items by category


Feedback


Multichannel Optical Networks

Multichannel Optical Networks

The huge bandwidth of optical fiber was recognized back in the 1970s... Read more

Find similar items

 

Make A Wish

Get what you want with an Amazon.co.uk Wish List Make sure you always get what you want with an Amazon.co.uk Wish List.

More info on Wish Lists

 

We've Got Converse

Converse
Stock up on your favourite styles with great deals on Converse shoes.

Shop Converse

 

Treat Someone

Amazon.co.uk Gift Certificates--available in any amount from £5 to £500 With an Amazon.co.uk Gift Certificate, you can get them what they want (even if you don't know what that is).

Learn more about Gift Certificates

 
Ad

Where's My Stuff?

Delivery and Returns

Need Help?

Your Recent History

  (What's this?)
You have no recently viewed items or searches.

After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in.

Look to the right column to find helpful suggestions for your shopping session.

Continue Shopping: Top Sellers
The Girl Who Played with Fire
Breaking Dawn (Twilight Saga)
The Girl with the Dragon Tattoo
The Host
The Host by Stephenie Meyer

amazon.co.uk Amazon Home
International Sites:  United States  |  Germany  |  France  |  Japan  |  Canada  |  China
Business Programs: Sell on Amazon  |  Fulfilment by Amazon  |  Join Associates  |  Join Advantage
Customer Service  |  Help  |  View Basket  |  Your Account
About Amazon.co.uk  |  Careers at Amazon
Conditions of Use & Sale |  Privacy Notice  © 1996-2009, Amazon.com, Inc. and its affiliates