Skip to main content
Conference Proceedings

A safe recursion scheme for exponential time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1234 44-52
DOI: 10.1007/3-540-63045-7_5
5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Using a function algebra characterization of exponential time due to Monien [5], in the style of Bellantoni-Cook [2], we characterize exponential time functions of linear growth via a safe course-of-values recursion scheme.

Author supplied keywords

Cite

CITATION STYLE

APA

Clote, P. (1997). A safe recursion scheme for exponential time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1234, pp. 44–52). Springer Verlag. https://doi.org/10.1007/3-540-63045-7_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free