Computers and Intractability. A Guide to the Theory of NP-Completeness

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273574

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,991

External links

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

Through your library

My notes

Similar books and articles

Review: Michael R. Garey, David S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness. [REVIEW]Harry R. Lewis - 1983 - Journal of Symbolic Logic 48 (2):498-500.
Π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. [REVIEW]Harry R. Lewis - 1983 - Journal of Symbolic Logic 48 (2):498-500.
On Completeness for Np Via Projection Translations.I. A. Stewart - 1991 - University of Newcastle Upon Tyne, Computing Laboratory.
Elements of the Theory of Computation.Harry R. Lewis & Christos H. Papadimitriou - 1998 - Prentice-Hall.
On NP-completeness in Linear Logic.Alexey P. Kopylov - 1995 - Annals of Pure and Applied Logic 75 (1-2):137-152.
The Mathematics of Logic: A Guide to Completeness Theorems and Their Applications.Richard Kaye - 2009 - Bulletin of Symbolic Logic 15 (2):216-218.
Michael Alekhnovich, Sam Buss, Shlomo Moran, and Toniann Pitassi. Minimum propositional proof length is NP-hard to linearly approximate. The journal of symbolic logic, vol. 66 , pp. 171–191. [REVIEW]Alexander Razborov - 2002 - Bulletin of Symbolic Logic 8 (2):301-302.
Review: Andrew M. Pitts, David W. Kueker, Edgar G. K. Lopez-Escobar, Carl H. Smith, Interpolation and Conceptual Completeness for Pretoposes via Category Theory; Andrew M. Pitts, Conceptual Completeness for First-order Intutionistic Logic: An Application of Categorical Logic. [REVIEW]Marek Zawadowski - 1995 - Journal of Symbolic Logic 60 (2):692-694.
Extensions of modal logic S5 preserving NP-completeness.Stéphane Demri - 1997 - Bulletin of the Section of Logic 26 (2):73-84.
Algebraic completeness results for r-Mingle and its extensions.J. Michael Dunn - 1970 - Journal of Symbolic Logic 35 (1):1-13.

Analytics

Added to PP
2015-02-05

Downloads
387 (#54,198)

6 months
47 (#93,587)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The dynamical hypothesis in cognitive science.Tim van Gelder - 1998 - Behavioral and Brain Sciences 21 (5):615-28.
Analyzing vision at the complexity level.John K. Tsotsos - 1990 - Behavioral and Brain Sciences 13 (3):423-445.
The Tractable Cognition Thesis.Iris Van Rooij - 2008 - Cognitive Science 32 (6):939-984.

View all 213 citations / Add more citations

References found in this work

No references found.

Add more references