Π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)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273574
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 46,355
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Completeness and the Ends of Axiomatization.Michael Detlefsen - 2014 - In Juliette Cara Kennedy (ed.), Interpreting Gödel. New York: Cambridge University Press. pp. 59-77.
Completeness: From Gödel to Henkin.Maria Manzano & Enrique Alonso - 2014 - History and Philosophy of Logic 35 (1):1-26.
Who Should Teach Computer Ethics and Computers & Society?Deborah Johnson - 1994 - Acm Sigcas Computers and Society 24 (2):6-13.

Analytics

Added to PP index
2016-06-30

Total views
21 ( #441,754 of 2,286,101 )

Recent downloads (6 months)
4 ( #319,399 of 2,286,101 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature