Author:
Avanzini Martin,Eguchi Naohi,Moser Georg
Subject
General Computer Science,Theoretical Computer Science
Reference39 articles.
1. A new recursion-theoretic characterization of the polytime functions;Bellantoni;Comput. Complexity,1992
2. Tyrolean complexity tool: features and usage;Avanzini,2013
3. Guest editorial: special issue on implicit computational complexity;Baillot;ACM Trans. Comput. Log.,2009
4. A new function algebra of EXPTIME functions by safe nested recursion;Arai;ACM Trans. Comput. Log.,2009
5. A path order for rewrite systems that compute exponential time functions;Avanzini,2011
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Read/write factorizable programs;Journal of Functional Programming;2023
2. Smarter Features, Simpler Learning?;Electronic Proceedings in Theoretical Computer Science;2019-12-31
3. From Jinja bytecode to term rewriting: A complexity reflecting transformation;Information and Computation;2018-08
4. A combination framework for complexity;Information and Computation;2016-06