A New Recursion-Theoretic Characterization Of The Polytime Functions

A New Recursion-Theoretic Characterization Of The Polytime Functions (1992)

by Stephen Bellantoni , Stephen Cook

Venue:	COMPUTATIONAL COMPLEXITY
Citations:	158 - 7 self

User correction supplied by mph

Datum	Value	Source
TITLE	A New Recursion-Theoretic Characterization Of The Polytime Functions	user correction
AUTHOR NAME	Stephen Bellantoni	user correction
AUTHOR NAME	Stephen Cook	user correction
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.	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	COMPUTATIONAL COMPLEXITY	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	97--110	INFERENCE
VOLUME	2	INFERENCE
CITATIONS	25 found	ParsCit 1.0