Computers and Intractability: A Guide to the Theory of NP-Completeness is a textbook by Michael Garey and David S.

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.

The problems (with their original names) are: Soon after it appeared, the book received positive reviews by reputed researchers in the area of theoretical computer science.

"[9] Harry R. Lewis praises the mathematical prose of the authors: "Garey and Johnson's book is a thorough, clear, and practical exposition of NP-completeness.

Also, he considers the appendix as "unique" and "as a starting point in attempts to show new problems to be NP-complete".