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

Journal of Symbolic Logic 48 (2):498-500 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

original Lewis, Harry R. (1983) "Review: Michael R. Garey, David S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness". Journal of Symbolic Logic 48(2):498-500

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,105

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2016-06-30

Downloads
59 (#348,214)

6 months
16 (#172,833)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references