Classifying the computational complexity of problems

Journal of Symbolic Logic 52 (1):1-43 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273858

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

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

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.
Computational Complexity.K. Wagner & G. Wechsung - 1989 - Journal of Symbolic Logic 54 (2):622-624.
On the Computational Complexity of Algorithms.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):120-121.
Abstraction and computational complexity.D. Leivant - 1990 - Journal of Symbolic Logic 55:379-80.
Computational Complexity of Recursive Sequences.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):121-122.
Computational complexity, speedable and levelable sets.Robert I. Soare - 1977 - Journal of Symbolic Logic 42 (4):545-563.
Logic and Complexity.Richard Lassaigne & Michel de Rougemont - 2012 - Springer Verlag.
Abstract Computational Complexity and Cycling Computations.Giorgio Ausiello - 1975 - Journal of Symbolic Logic 40 (2):248-248.
On computational complexity in weakly admissible structures.Viggo Stoltenberg-Hansen - 1980 - Journal of Symbolic Logic 45 (2):353-358.

Analytics

Added to PP
2009-01-28

Downloads
67 (#327,291)

6 months
15 (#168,777)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Tractable competence.Marcello Frixione - 2001 - Minds and Machines 11 (3):379-397.
Complexity of intuitionistic propositional logic and its fragments.Mikhail Rybakov - 2008 - Journal of Applied Non-Classical Logics 18 (2):267-292.
Elementare ma complessa: la prospettiva della complessità computazionale attraverso il caso studio della geometria di Tarski.Pierluigi Graziani - 2012 - In Vincenzo Fano, Enrico Giannetto, Giulia Giannini & Pierluigi Graziani, Complessità e Riduzionismo. ISONOMIA - Epistemologica Series Editor. pp. 66-81.

View all 8 citations / Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Weak Second‐Order Arithmetic and Finite Automata.J. Richard Büchi - 1960 - Mathematical Logic Quarterly 6 (1-6):66-92.
Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität.Günter Asser - 1955 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (4):252-263.

Add more references