Author:
Baillot Patrick,Gaboardi Marco,Mogbil Virgile
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity 2(2), 97–110 (1992)
2. Leivant, D.: A foundational delineation of computational feasibility. In: Meyer, A.R. (ed.) LICS 1991, pp. 2–11. IEEE Computer Society, Los Alamitos (1991)
3. Lecture Notes in Computer Science;D. Leivant,1993
4. Girard, J.Y.: Light linear logic. Information and Computation 143(2), 175–204 (1998)
5. Hofmann, M.: Linear types and non-size-increasing polynomial time computation. In: LICS 1999, pp. 464–473 (1999)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献