Author:
Bonfante Guillaume,Deloup Florian
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133–178 (2000)
2. Lecture Notes in Computer Science;M. Avanzini,2008
3. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in real algebraic geometry. Springer, Heidelberg (2003)
4. Bonfante, G., Cichon, A., Marion, J.-Y., Touzet, H.: Algorithms with polynomial interpretation termination proof. Journal of Functional Programming 11(1), 33–53 (2001)
5. Bonfante, G., Deloup, F.: Complexity invariance of real interpretations. Technical report, LORIA (2010), http://www.loria.fr/~bonfante/ciri.pdf
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献