Review: Michael R. Garey, David S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness
Harry R. Lewis
Source: J. Symbolic Logic Volume 48, Issue 2 (1983), 498-500.
Reviewed Works:
Michael R. Garey, David S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness.
Full-text: Remote access
If you are a member of the ASL, log in to Euclid for access.
Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jsl/1183741273
JSTOR: links.jstor.org
