A characterization of alternating log time by first order functional programs

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

Volumn 4246 LNAI, Issue , 2006, Pages 90-104

  Bonfante, Guillaume ^a   Marion, Jean Yves ^a   Péchoux, Romain ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; POLYNOMIAL APPROXIMATION; TURING MACHINES;

FUNCTIONAL PROGRAMMING LANGUAGES; PROGRAM RESOURCES; PROGRAM SCHEMAS; SPACE AND TIME BOUNDS;

COMPUTATIONAL METHODS;

EID: 33845211214     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_7     Document Type: Conference Paper

References (32)

1. R. Amadio. Synthesis of max-plus quasi-interpretations. Fundamenta, Informaticae, 65(1-2), 2005.
2. R. Amadio, S. Coupet-Grimal, S. Dal-Zilio, and L. Jakubiec. A functional scenario for bytecode verification of resource bounds. In CSL, volume 3210 of LNCS, pages 265-279, 2004.
3. R. Amadio and S. Dal-Zilio. Resource control for synchronous cooperative threads. In CONCUR, volume 3170 of LNCS, pages 68-82, 2004.
4. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. TCS, 236:133-178, 2000.
5. 1-formulae on finite strutures. Annals of Pure and Applied Logic, 24:1-48, 1983.
6. D. Barrington, N. Immerman, and H. Straubing. On uniformity within nc. J. of Computer System Science, 41(3):274-306, 1990.
7. S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97-110, 1992.
8. S. Bloch. Function-algebraic characterizations of log and polylog parallel time. Computational complexity, 4(2): 175-205, 1994.
9. G. Bonfante, R. Kahle, J.-Y. Marion, and I. Oitavem. Towards an implicit characterization of NCk. In CSL'06, LNCS, 2006.
10. G. Bonfante, J.-Y. Marion, and J.-Y. Moyen. Quasi-interpretation: a way to control ressources, survey submitted, revision. http://www.loria/~marionjy.
11. G. Bonfante, J.-Y. Marion, J.-Y. Moyen, and R. Péchoux. Synthesis of quasi-interpretations. Workshop on Logic and Complexity in Computer Science, LCC2005, Chicago, 2005. http://www.loria/~pechoux.
12. S. Buss. The boolean formula value problem is in ALOGTIME. In STOC, pages 123-131, 1987.
13. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. Journal of the ACM, 28:114-133, 1981.
14. P. Clote. Computational models and function, algebras. In D. Leivant, editor, LCC'94, volume 960 of LNCS, pages 98-130, 1995.
15. A. Cobham, The intrinsic computational difficulty of functions. In Conf. on Logic, Methodology, and Philosophy of Science, pages 24-30. North-Holland, 1962.
16. K.J. Compton and G. Laflamme. An algebra and a logic for ne. Inf. Comput., 87(1/2):240-262, 1990.
17. S.A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64(1-3):2-21, 1985.
18. S. Dal-Zilio and R. Gascon. Resource bound certification for a tail-recursive virtual machine. In APLAS 2005, volume 3780 of LNCS, pages 247-263, 2005.
19. M. Furst, J. Saxe, and M. Spiser. Parity, circuits, and the polynomial time hierarchy. Math. Systems Theory, 17:13-27, 1984.
20. J.-Y. Girard. Light linear logic. In D. Leivant, editor, LCC'94, number 960 in LNCS, 1995.
21. M. Hofmann. Programming languages capturing complexity classes. SIGACT News Logic Column 9, 2000.
22. L. Kristiansen and N.D. Jones. The flow of data and the complexity of algorithms. In New Computational Paradigms, number 3526 in LNCS, pages 263-274, 2005.
23. C. S. Lee, N. D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. In POPL, volume 28, pages 81-92, 2001.
24. D. Leivant. Predicative recurrence and computational complexity I: Word recurrence and poly-time. In Feasible Mathematics II, pages 320-343. Birkhäuser, 1994.
25. D. Leivant. A characterization of NC by tree recurrence. In 39th Annual Symposium on Foundations of Computer Science, FOCS'98, pages 716-724, 1998.
26. D. Leivant and J.-Y. Marion. Lambda Calculus Characterizations of Poly-Time. Fundamenta Informaticae, 19(1,2):167-184, September 1993.
27. D. Leivant and J.-Y. Marion. A characterization of alternating log time by ramified recurrence. TCS, 236(1-2):192-208, Apr 2000.
28. J.-Y. Marion and J.-Y. Moyen. Efficient first order functional program interpreter with time bound certifications. In LPAR, volume 1955 of LNCS, pages 25-42, 2000.
29. J.-Y. Marion and R. Péchoux. Resource analysis by sup-interpretation. In FLOPS 2006, volume 3945 of LNCS, pages 163-176, 2006.
30. J.-Y. Moyen. Analyse de la complexité et transformation de programmes. Thèse d'université, Nancy 2, Dec 2003.
31. K.-H. Niggl and H. Wunderlich. Certifying polynomial time and linear/polynomial space for imperative programs. SIAM J. on Computing, to appear.
32. W. Ruzzo. On uniform circuit complexity. J. of Computer System Science, 22(3):365-383, 1981.