Garey and Johnson

(thing) by flyingroc Wed Feb 07 2001 at 3:42:52
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.

del.icio.us Furl Facebook Digg StumbleUpon Reddit   (I like it!)
Y'know, if you log in, you can write something here, or contact authors directly on the site. Create a New User if you don't already have an account.