Access

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

Review

Reviewed Work: Computers and Intractability: A Guide to the Theory of NP-Completeness. by Michael R. Garey, David S. Johnson
Review by: Juris Hartmanis
SIAM Review
Vol. 24, No. 1 (Jan., 1982), pp. 90-91
Stable URL: http://www.jstor.org/stable/2029450
Page Count: 2
  • More info
  • Cite this Item
Item Type
Article
Thumbnails
If you need an accessible version of this item please contact JSTOR User Support
Preview not available
Preview not available

Page Thumbnails

  • Thumbnail: Page 
90
    90
  • Thumbnail: Page 
91
    91