The shorthand term for the classic computer science book Computers and Intractability: A Guide to the Theory of NP-Completeness by Michael Garey and David Johnson. It was published in 1979, and it contains a collection of known NP-Complete problems. People who do NP-complete proofs often use some problem in the book as a starting point.

Required reading for those who want to study algorithms.

Log in or register to write something here or to contact authors.