Computers and Intractability
first publication date: 1979
genre: textbook
original title: Computers and Intractability: A Guide to the Theory of NP-Completeness
original language: English
main subject: computer science
Computers and Intractability: A Guide to the Theory of NP-Completeness is a textbook by Michael Garey and David S. Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature. Source: Wikipedia (en)
Editions
No editions found
Work - wd:Q938821