A characterization of alternating log time by ramified recurrence

Theoretical Computer Science

Volumn 236, Issue 1-2, 2000, Pages 193-208

  Leivant, Daniel ^a   Marion, Jean Yves ^b  

^a INDIANA UNIVERSITY   (United States)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Alogtime; Alternation; Implicit computational complexity; Ramified recursion; Recursion with substitution parameters; Tree recursion

Indexed keywords

EID: 0345753655     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00209-1     Document Type: Article

References (20)

1. S. Bellantoni, Characterizing parallel time by type 2 recursions with polynomial output length, in: D. Leivant (Ed.), Logic and Computational Complexity, Lecture Notes in Computer Science, Vol. 960, Springer, Berlin, pp. 253-268.
2. S. Bellantoni, S. Cook, A new recursion-theoretic characterization of the poly-time functions, Comput. Complexity 2 (1992) 97-110.
3. S. Bloch, Function-algebraic characterizations of log and polylog parallel time, Comput. Complexity 4(2) (1994) 175-205.
4. A. Chandra, D. Kozen, L. Stockmeyer, Alternation, J. ACM 28 (1981) 114-133.
5. P. Clote, Computation models and function algebras, in: E. Griffor (Ed.), Handbook of Recursion Theory, North-Holland, Amsterdam, 1997.
6. E. Cohors-Fresenborg, Subrekursive Funktionenklassen über binären Bäumen, Ph.D. Thesis, Universität Münster, 1971.
7. E. Cohors-Fresenborg, Elementare and subelementare funktionenklassen über binären bäumen, GI-Fachtg. Automathenth. Form Sprach 1 (1973) 220-229.
8. 1, Inform. Comput. 87 (1990) 241-263.
9. J. van Heijenoort, From Frege to Gödel, A Source Book in Mathematical Logic, 1879-1931, Harvard University Press, Cambridge, MA, 1967.
10. N.D. Jones, Computability and Complexity from a Programming Perspective, MIT Press, Cambridge, MA, 1997.
11. D. Leivant, Subrecursion and lambda representation over free algebras, in: S. Buss, P. Scott (Eds.), Feasible Mathematics, Perspectives in Computer Science, Birkhauser, Boston, New York, 1990, pp. 281-291.
12. D. Leivant, Stratified functional programs and computational complexity, Conf. Record of the 20th Annual ACM Symp. on Principles of Programming Languages, ACM, New York, 1993, pp. 325-333.
13. D. Leivant, Ramified recurrence and computational complexity I: word recurrence and poly-time, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II, Birkhäuser, Boston, New York, 1994, pp. 320-343.
14. D. Leivant, J.-Y. Marion, Application characterizations of poly-space, Extended Abstract, 1994.
15. D. Leivant, J.-Y. Marion, Ramified recurrence and computational complexity II: substitution and poly-space, in: L. Pacholski, J. Tiuryn (Eds.), Proc. CSL 94, Lecture Notes in Computer Science, Vol. 933, Springer, Berlin, 1995, pp. 486-500.
16. D. Leivant, J.-Y. Marion, Predicative functional recurrence and poly-space, in: M. Bidoit, M. Dauchet (Eds.), TAPSOFT'97 CAAP, Lecture Notes in Computer Science, Vol. 1214, Springer, Berlin, April 1997, pp. 369-380.
17. H.E. Rose, Subrecursion, Clarendon Press, Oxford University Press, Oxford, 1984.
18. W. Ruzzo, On uniform circuit complexity, J. Comput. System Sci. 22 (1981) 365-383.
19. H. Simmons, The realm of primitive recursion, Arch. Math. Logic 27 (1988) 177-188.
20. P. Voda, Subrecursion as basis for a feasible programming language, in: CSL'94, number 933 in Lecture Notes in Computer Science, Springer, Berlin, 1995.