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.
Research supported in part by NSF CCR-9408090, US-Czech Science and Technology Grant 93-025 and by the Volkswagen Stiftung.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Bellantoni. Predicative recursion and computational complexity. Technical Report 264/92, University of Toronto, Computer Science Department, September 1992. 164 pages.
S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97–110, 1992.
S. Bloch. Function-algebraic characterizations of log and polylog parallel time. Computational Complexity, 4(2):175–205, 1994.
P. Clote. Computation models and function algebras. In E. Griffor, editor, Handbook of Recursion Theory. North Holland, in preparation.
B. Morden. A recursive and grammatical characterization of exponential time languages. Theoretical Computer Science, 3:61–74, 1977.
K. Wagner and G. Wechsung. Computational Complexity. Reidel Publishing Co., 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clote, P. (1997). A safe recursion scheme for exponential time. In: Adian, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63045-7_5
Download citation
DOI: https://doi.org/10.1007/3-540-63045-7_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63045-6
Online ISBN: 978-3-540-69065-8
eBook Packages: Springer Book Archive