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,410

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.
Completeness: from Gödel to Henkin.Maria Manzano & Enrique Alonso - 2014 - History and Philosophy of Logic 35 (1):1-26.
What makes a theory physically “complete”?Andrew Elby, Harvey R. Brown & Sara Foster - 1993 - Foundations of Physics 23 (7):971-985.
Why self-control is both difficult and difficult to explicate.David Premack & Ann James Premack - 1995 - Behavioral and Brain Sciences 18 (1):140-141.
The mathematics of logic: a guide to completeness theorems and their applications.Richard Kaye - 2007 - New York: Cambridge University Press.
Intractability and the use of heuristics in psychological explanations.Iris Rooij, Cory Wright & Todd Wareham - 2012 - Synthese 187 (2):471-487.
Eksperymenty komputerowe w matematyce.Anna Lemańska - 1996 - Filozofia Nauki 3.
Modern Just War Theory: A Guide to Research.Michael Farrell - 2013 - Scarecrow Press.
Ourselves and Computers: Differences in Minds and Machines.Aart Bijl - 1995 - Palgrave.
Presuppositional completeness.Wojciech Buszkowski - 1989 - Studia Logica 48 (1):23 - 34.
Using Computers in English. A Practical Guide.Phil Moore - 1987 - British Journal of Educational Studies 35 (2):185-186.
Philosophy and Technology II: Information Technology and Computers in Theory and Practice.Carl Mitcham & Alois Huning (eds.) - 1985 - Reidel.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Arithmetical completeness versus relative completeness.Michal Grabowski - 1988 - Studia Logica 47 (3):213 - 220.
Completeness as an Ideal for Moral Theory.Sean David Mckeever - 2001 - Dissertation, The University of North Carolina at Chapel Hill

Analytics

Added to PP
2015-02-05

Downloads
383 (#53,414)

6 months
49 (#90,485)

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