Abstract.
We give function algebraic characterizations of the polynomial time computable functions using unbounded recursion schemes without introducing extra notions such as safe and normal in variables and tiering in word algebras.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 9 1998.
Rights and permissions
About this article
Cite this article
Ishihara, H. Function algebraic characterizations of the polytime functions. Comput. complex. 8, 346–356 (1999). https://doi.org/10.1007/s000370050004
Issue date:
DOI: https://doi.org/10.1007/s000370050004
