Inferring Lower Bounds for Runtime Complexity

Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder. Inferring Lower Bounds for Runtime Complexity. In Maribel Fernández, editor, 26th International Conference on Rewriting Techniques and Applications, RTA 2015, June 29 to July 1, 2015, Warsaw, Poland. Volume 36 of LIPIcs, pages 334-349, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]

Abstract

Abstract is missing.