If you need an accessible version of this item please contact JSTOR User Support

Review

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
DOI: 10.2307/2273574
Stable URL: http://www.jstor.org/stable/2273574
Page Count: 3
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
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.

Page Thumbnails

  • Thumbnail: Page 
498
    498
  • Thumbnail: Page 
499
    499
  • Thumbnail: Page 
500
    500