Implicit characterizations of Pspace

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

Volumn 2183, Issue , 2001, Pages 170-190

  Oitavem, Isabel ^a  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

Computational complexity; Implicit characterizations; Pspace; Term rewriting

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTERS;

POLYNOMIAL SPACE; PSPACE; RECURSION SCHEMES; TERM REWRITING;

ARTIFICIAL INTELLIGENCE;

EID: 84944073334     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45504-3_11     Document Type: Conference Paper

References (18)

1. Beckmann A., Weiermann A.: A term rewriting characterization of the polytime functions and related complexity classes, Archive for Mathematical Logic 36, 1996, pp.11-30.
2. Bellantoni S.: Predicative Recursion and Computational Complexity, Ph. D. Dissertation, University of Toronto, 1993.
3. Bellantoni S.: Predicative Recursion and the Polytime Hierarchy, Feasible Mathematics II, ed. P.Clote and J.B.Remmel, Birkhauser, 1995, pp.15-29.
4. Bellantoni S., Cook S.: A New Recursion-Theoretic Characterization of Polytime Functions, Computational Complexity, vol.2, 1992, pp.97-110.
5. 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.
6. Bellantoni S., Oitavem I.: Separating NC along the δ axis, submitted.
7. Buss S.: Bounded Arithmetic, Bibliopolis, 1986.
8. Cichon E.A., Weiermann A.: Term rewriting theory for the primitive recursive functions, Annals of Pure and Applied Logic 83, 1997, pp.199-223.
9. Ferreira F.: Polynomial Time Computable Arithmetic and Conservative Extensions, Ph. D. Dissertation, Pennsylvania State University, 1988.
10. Ferreira F.: Polynomial Time Computable Arithmetic, Contemporary Mathematics, Volume 106, 1990, pp.137-156.
11. 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.
12. Leivant D. and Marion J.-Y.: Ramified Recurrence and Computational Complexity IV: Predicative functionals and poly-space, Preprint.
13. Niggl K.-H.: The μ-Measure as a Tool for Classifying Computacional Complexity, Archive for Mathematical Logic, vol.39, N.7, 2000, pp.509-514.
14. Oitavem I.: Tres assuntos de Logica e Complexidade, Master thesis, Universidade de Lisboa, 1995.
15. 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.
16. Oitavem I.: A term rewriting characterization of the functions computable in polynomial space, Archive for Mathematical Logic, to appear.
17. Oitavem I.: Classes of Computational Complexity: Implicit Characterizations — a Study in Mathematical Logic, Ph.D. thesis, Universidade de Lisboa, 2001.
18. Papadimitriou C.H.: Computational Complexity, Addison-Wesley Publishing Company, 1994.