Computers and Intractability: A Guide to the Theory of NP-Completeness
by M. R. Garey, David S. Johnson
Series of Books in the Mathematical Sciences
On This Page
Description
"Shows how to recognize NP-complete problems and offers proactical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains and extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. [This book] is suitable as a supplement to courses in algorithm design, computational complexity, operations show more research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science"--Back cover. show lessTags
Recommendations
Member Reviews
Members
- Recently Added By
Lists
Most Cited Math Books
18 works; 1 member
Author Information
1 Work 295 Members
1 Work 3 Members
Series
Common Knowledge
- Canonical title
- Computers and Intractability: A Guide to the Theory of NP-Completeness
Classifications
- Genres
- Technology, Nonfiction, General Nonfiction, Science & Nature
- DDC/MDS
- 519.4 — Natural sciences & mathematics Mathematics Probabilities and applied mathematics Applied numerical analysis
- LCC
- QA76.6 .G35 — Science Mathematics Mathematics Instruments and machines Calculating machines Electronic computers. Computer science
- BISAC
Statistics
- Members
- 295
- Popularity
- 108,992
- Reviews
- 1
- Rating
- (4.20)
- Languages
- English
- Media
- Paper
- ISBNs
- 3
- ASINs
- 2
