- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Classifying the computational complexity of problems
Journal of Symbolic Logic 52 (1):1-43 (1987)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On the complexity of classifying lebesgue spaces.Tyler A. Brown, Timothy H. Mcnicholl & Alexander G. Melnikov - 2020 - Journal of Symbolic Logic 85 (3):1254-1288.
On the Capture of Complexity Classes Using Logic.I. A. Stewart - 1991 - University of Newcastle Upon Tyne, Computing Laboratory.
On the Computational Complexity of Algorithms.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):120-121.
The Computational Complexity of Logical Theories.Dirk Siefkes - 1984 - Journal of Symbolic Logic 49 (2):670-671.
Computational Complexity of Recursive Sequences.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):121-122.
Review: Larry Wos, Automated Reasoning: 33 Basic Research Problems. [REVIEW]William M. Farmer - 1988 - Journal of Symbolic Logic 53 (4):1258-1259.
Elements of the Theory of Computation.Harry R. Lewis & Christos H. Papadimitriou - 1984 - Journal of Symbolic Logic 49 (3):989-990.
Abstract Computational Complexity and Cycling Computations.Giorgio Ausiello - 1975 - Journal of Symbolic Logic 40 (2):248-248.
Analytics
Added to PP
2009-01-28
Downloads
43 (#110,248)
6 months
13 (#1,035,185)
2009-01-28
Downloads
43 (#110,248)
6 months
13 (#1,035,185)
Historical graph of downloads
Citations of this work
Idealisation, naturalism, and rationality: Some lessons from minimal rationality.C. A. Hooker - 1994 - Synthese 99 (2):181 - 231.
A uniform method for proving lower bounds on the computational complexity of logical theories.Kevin J. Compton & C. Ward Henson - 1990 - Annals of Pure and Applied Logic 48 (1):1.
Logic programming and knowledge representation—The A-Prolog perspective.Michael Gelfond & Nicola Leone - 2002 - Artificial Intelligence 138 (1-2):3-38.
Complexity of intuitionistic propositional logic and its fragments.Mikhail Rybakov - 2008 - Journal of Applied Non-Classical Logics 18 (2):267-292.
References found in this work
Computers and Intractability. A Guide to the Theory of NP-Completeness.Michael R. Garey & David S. Johnson - 1983 - Journal of Symbolic Logic 48 (2):498-500.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1949 - Journal of Symbolic Logic 14 (3):188-188.
Elementary Induction on Abstract Structures.Wayne Richter - 1979 - Journal of Symbolic Logic 44 (1):124-125.
Weak Second‐Order Arithmetic and Finite Automata.J. Richard Büchi - 1960 - Mathematical Logic Quarterly 6 (1-6):66-92.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-xdvnm uwo