A new recursion-theoretic characterization of the polytime functions (extended abstract)

Authors:
Stephen Bellantoni;Stephen Cook
Affiliations:
Department of Computer Science, University of Toronto;Department of Computer Science, University of Toronto
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Citing 4
Cited 10

Functional interpretations of feasibly constructive arithmetic

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A new recursion-theoretic characterization of the polytime functions

Computational Complexity
A foundational delineation of poly-time

Papers presented at the IEEE symposium on Logic in computer science
Feasibly constructive proofs and the propositional calculus (Preliminary Version)

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing

A query language for list-based complex objects

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Functional database query languages as typed lambda calculi of fixed order (extended abstract)

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Sequences, Datalog and transducers

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Cut and paste

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimizing object queries using an effective calculus

ACM Transactions on Database Systems (TODS)
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
PBINT, a logic for modelling search problems involving arithmetic

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Structural recursion on ordered trees and list-based complex objects

ICDT'07 Proceedings of the 11th international conference on Database Theory
Calculating polynomial runtime properties

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Identifying polynomial-time recursive functions

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a recursion-theoretic characterization of FP which describes polynomial time computation independently of any externally imposed resource bounds. In particular, this syntactic characterization avoids the explicit size bounds on recursion (and the initial function 2|x|.|y|) of Cobham.