Review of "Computers and intractability. A guide to the theory of NP-completeness"

  • Lewis H
ISSN: 0022-4812
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

//static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0022481200038524/resource/name/firstPage-S0022481200038524a.jpg

Cite

CITATION STYLE

APA

Lewis, H. R. (1983). Review of “Computers and intractability. A guide to the theory of NP-completeness.” Journal of Symbolic Logic (Vol. 48, pp. 498–500). Freeman.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free