Hostname: page-component-76c49bb84f-t7r7g Total loading time: 0 Render date: 2025-07-13T03:00:11.253Z Has data issue: false hasContentIssue false
  • English
  • Français

Michael R. ΠGarey and David S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco1979, x + 338 pp.

Review products

Michael R. ΠGarey and David S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco1979, x + 338 pp.

Published online by Cambridge University Press:  12 March 2014

Harry R. Lewis
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Reviews
Information
The Journal of Symbolic Logic , Volume 48 , Issue 2 , June 1983 , pp. 498 - 500
Copyright
Copyright © Association for Symbolic Logic 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable