Towards an implicit characterization of NCk

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

Volumn 4207 LNCS, Issue , 2006, Pages 212-224

  Bonfante, G ^a   Kahle, R ^b,c   Marion, J Y ^a   Oitavem, I ^c,d  

^a LORIA   (France)

^b UNIVERSITY OF COIMBRA   (Portugal)

^c UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^d UNIVERSITY OF LISBON   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DATA STRUCTURES; RECURSIVE FUNCTIONS;

IMPLICIT CHARACTERIZATION; POINTER TECHNIQUE; RECURSION SCHEMA; TIERING;

HIERARCHICAL SYSTEMS;

EID: 33750355911     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11874683_14     Document Type: Conference Paper

References (18)

1. [AJSTOl] Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, and Sebastiaan Terwijn. Linear ramified higher type recursion and parallel complexity. In R. Kahle, P. Schroeder-Heister, and R. Stärk, editors, Proof Theory in Computer Science, volume 2183 of Lecture Notes in Computer Science, pages 1-21. Springer. 2001.
2. [BC92] S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2:97-110, 1992.
3. [Blo94] S. Bloch. Function-algebraic characterizations of log and polylog parallel time. Computational Complexity, 4(2):175-205. 1994.
4. [BM04] Patrick Baillot and Virgile Mogbil. Soft lambda-calculus: A language for polynomial time computation. In Igor Walukiewicz, editor, Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004, volume 2987 of Lecture Notes in Computer Science, pages 27-41. Springer, 2004.
5. [BO04] S. Bellantoni and I. Oitavem. Separating NC along the δ axis. Theoretical Computer Science, 318:57-78, 2004.
6. k and NC. In S. Buss and P. Scott, editors, Feasible Mathematics, pages 49-69. Birkhäuser, 1990.
7. [Hof99] Martin Hofmann. Linear types and non-size-increasing polynomial time computation. In Symposium on Logic in Computer Science (LICS '99), pages 464-473. IEEE, 1999.
8. [Hof02] Martin Hofmann. The strength of non-size increasing computation. In POPL '02: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 260-269. ACM Press, New York, NY, USA, 2002.
9. [Lei95] Daniel Leivant. Ramifed recurrence and computational complexity I: Word recurrence and poly-time. In P. Clote and J. B. Remmel, editors, Feasible Mathematics II, pages 320-343. Birkhäuser, 1995.
10. [Lei98] Daniel Leivant. A characterization of NC by tree recursion. In FOCS 1998, pages 716-724. IEEE Computer Society, 1998.
11. [LM93] Daniel Leivant and Jean-Yves Marion. Lambda calculus characterizations of poly-time. Fundamenta Informaticae, 19(1/2):167-184, 1993.
12. [LM95] Daniel Leivant and Jean-Yves Marion. Ramified recurrence and computational complexity II: substitution and poly-space. In L. Pacholski and J. Tiuryn, editors, Proceedings of CSL 94, pages 486-500. LNCS 933, Springer Verlag, 1995.
13. [LM00] Daniel Leivant and Jean-Yves Marion. A characterization of alternating log time by ramified recurrence. Theoretical Computer Science, 236(1-2):192-208, 2000.
14. [Nee04] Peter Møller Neergaard. A functional language for logarithmic space. In Prog. Lang, and Systems: 2nd Asian Symp. (APLAS 2004), volume 3302 of LNCS, pages 311-326. Springer-Verlag, 2004.
15. [Nig05] Karl-Heinz Niggl. Control structures in programs and computational complexity. Annals of Pure and Applied Logic, 133(1-3):247-273, 2005. Festschrift on the occasion of Helmut Schwichtenberg's 60th birthday.
16. [Oit04] Isabel Oitavem. Characterizing NC with tier 0 pointers. Mathematical Logic Quarterly, 50:9-17, 2004.
17. [Ruz81] W. L. Ruzzo. On uniform circuit complexity. J. Comp. System Sci., 22:365-383, 1981.
18. [Sim88] H. Simmons. The realm of primitive recursion. Archive for Mathematical Logic, 27:177-188, 1988.