You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Reviewed Work: Computers and Intractability. A Guide to the Theory of NP-Completeness by Michael R. Garey, David S. Johnson
Review by: Harry R. Lewis
The Journal of Symbolic Logic
Vol. 48, No. 2 (Jun., 1983), pp. 498-500
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2273574
Page Count: 3
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Note: This article is a review of another work, such as a book, film, musical composition, etc. The original work is not included in the purchase of this review.
The Journal of Symbolic Logic © 1983 Association for Symbolic Logic