PineWikiMichael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Sons, 1979. QA76.6 G35
Classic reference for NP-complete problems and early results in complexity theory.
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Sons, 1979. QA76.6 G35
Classic reference for NP-complete problems and early results in complexity theory.
GareyAndJohnson (last edited 2007-12-25 23:42:27 by localhost)