Abstract
In this paper we focus on the class of functions computable in deterministic polynomial space — Pspace. Our aim is to give a survey on implicit characterizations of Pspace. Special attention will be given to characterizations where no bounded recursion scheme is invoked and within them to term rewriting characterizations.
The author would like to thank to CMAF and Fundação para a Ciência e a Tecnologia.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beckmann A., Wweiermann A.: A term rewriting characterization of the polytime functions and related complexity classes, Archive for Mathematical Logic 36, 1996, pp.11–30.
Bellantoni S.: Predicative Recursion and Computational Complexity, Ph. D. Dissertation, University of Toronto, 1993.
Bellantoni S.: Predicative Recursion and the Polytime Hierarchy, Feasible Mathematics II, ed. P. Clote and J. B. Remmel, Birkhäuser, 1995, pp.15–29.
Bellantoni S., Cook S.: A New Recursion-Theoretic Characterization of Polytime Functions, Computational Complexity, vol.2, 1992, pp.97–110.
Bellantoni S., Niggl K.-H.: Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited, SIAM Journal of Computing, vol.29, N.2, 1999, pp.401–415.
Bellatoni S., Oitavem I.: Separating NC along the δ axis, submitted.
Buss S.: Bounded Arithmetic, Bibliopolis, 1986.
Cichon E.A., Weiermann A.: Term rewriting theory for the primitive recursive functions, Annals of Pure and Applied Logic 83, 1997, pp.199–223.
Ferreira F.: Polynomial Time Computable Arithmetic and Conservative Extensions, Ph. D. Dissertation, Pennsylvania State University, 1988.
Ferreira F.: Polynomial Time Computable Arithmetic, Contemporary Mathematics, Volume 106, 1990, pp.137–156.
Leivant D. and Marion J.-Y.: Ramified Recurrence and Computational Complexity II: Substitution and Poly-space, Computer Science Logic, ed. L. Pacholski and J. Tiuryn, Springer-Verlag, 1995, pp.486–500.
Leivant D. and Marion J.-Y.: Ramified Recurrence and Computational Complexity IV: Predicative functionals and poly-space, Preprint.
Niggl K.-H.: The μ-Measure as a Tool for Classifying Computacional Complexity, Archive for Mathematical Logic, vol.39, N.7, 2000, pp.509–514.
Oitavem I.: Três assuntos de Lógica e Complexidade, Master thesis, Universidade de Lisboa, 1995.
Oitavem I.: New recursive characterizations of the elementary functions and the functions computable in polynomial space, Revista Matematica de la Universidad Complutense de Madrid, vol.10, N.1, 1997, pp.109–125.
Oitavem I.: A term rewriting characterization of the functions computable in polynomial space, Archive for Mathematical Logic, to appear.
Oitavem I.: Classes of Computational Complexity: Implicit Characterizations — a Study in Mathematical Logic, Ph.D. thesis, Universidade de Lisboa, 2001.
Papadimitriou C.H.: Computational Complexity, Addison-Wesley Publishing Company, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oitavem, I. (2001). Implicit Characterizations of Pspace . In: Kahle, R., Schroeder-Heister, P., Stärk, R. (eds) Proof Theory in Computer Science. PTCS 2001. Lecture Notes in Computer Science, vol 2183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45504-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-45504-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42752-0
Online ISBN: 978-3-540-45504-2
eBook Packages: Springer Book Archive