Author:
Leivant Daniel,Marion Jean-Yves
Reference31 articles.
1. Hendrick P. Barendregt, The Lambda-Calculus: Its Syntax and Semantics, North-Holland, 1980.
2. Corrado Böhm and Allessandro Berarducci, Automatic synthesis of typed λ-programs on term algebras, Theoretical Computer Science 39 (1985) 135–154.
3. Stephen Bellantoni and Stephen Cook, A new recursion-theoretic characterization of the poly-time functions, to appear in Computational Complexity 1992.
4. Stephen Bloch, Functional characterizations of uniform log-depth and polylog-depth circuit families, to appear in the Proceedings of the 1992 IEEE Conference on Structure in Complexity.
5. Samuel Buss, Bounded Arithmetic, Bibliopolis, Naples, 1986.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献