Author:
Noschinski Lars,Emmes Fabian,Giesl Jürgen
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference30 articles.
1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comp. Sci. 236, 133–178 (2000)
2. Avanzini, M., Moser, G., Schnabl, A.: Automated implicit computational complexity analysis. In: Proc. IJCAR ’08, LNAI 5195, pp. 132–138 (2008)
3. Avanzini, M., Moser, G.: Dependency pairs and polynomial path orders. In: Proc. RTA ’09, LNCS 5595, pp. 48–62 (2009)
4. Avanzini, M., Moser, G.: Closing the gap between runtime complexity and polytime computability. In: Proc. RTA ’10, LIPIcs 6, pp. 33–48 (2010)
5. Avanzini, M., Moser, G.: Complexity analysis by graph rewriting. In: Proc. FLOPS ’10, LNCS 6009, pp. 257–271 (2010)
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献