tlooto
Sign up
MathematicsComputer Science

A new recursion-theoretic characterization of the polytime functions

S. Bellantoni, S. Cook

1992.7.1COMPUTATIONAL COMPLEXITY

DOI: 10.1007/bf01201998

tlooto Summary

A recursion-theoretic characterization of FP which describes polynomial time computation independently of any externally imposed resource bounds, and avoids the explicit size bounds on recursion of Cobham.

Abstract

Abstract is not available.

Citation format

BELLANTONI, S.; COOK, S. A new recursion-theoretic characterization of the polytime functions. COMPUTATIONAL COMPLEXITY, 1992, 2: 97–110.