A safe recursion scheme for exponential time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1234, Issue , 1997, Pages 44-52

  Clote, Peter ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Exponential time; Function algebra; Safe recursion

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EXPONENTIAL TIME; FUNCTION ALGEBRA; LINEAR GROWTH; RECURSION SCHEMES; SAFE RECURSION;

ALGEBRA;

EID: 21744446387     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63045-7_5     Document Type: Conference Paper

References (6)

1. S. Bellantoni. Predicative recursion and computational complexity. Technical Report 264/92, University of Toronto, Computer Science Department, September 1992. 164 pages.
2. S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97-110, 1992.
3. S. Bloch. Function-algebraic characterizations of log and polylog parallel time. Computational Complexity, 4(2):175-205, 1994.
4. P. Clote. Computation models and function algebras. In E. Griffor, editor, Handbook of Recursion Theory. North Holland, in preparation.
5. B. Monien. A recursive and grammatical characterization of exponential time languages. Theoretical Computer Science, 3:61-74, 1977.
6. K. Wagner and G. Wechsung. Computational Complexity. Reidel Publishing Co., 1986.