Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
Inferring Lower Bounds for Runtime Complexity
RTA, 2015.
@inproceedings{RTA-2015-FrohnGHAS,
author = "Florian Frohn and Jürgen Giesl and Jera Hensel and Cornelius Aschermann and Thomas Ströder",
booktitle = "{Proceedings of the 26th International Conference on Rewriting Techniques and Applications}",
doi = "10.4230/LIPIcs.RTA.2015.334",
isbn = "978-3-939897-85-9",
pages = "334--349",
publisher = "{Schloss Dagstuhl — Leibniz-Zentrum für Informatik}",
series = "{Leibniz International Proceedings in Informatics}",
title = "{Inferring Lower Bounds for Runtime Complexity}",
volume = 36,
year = 2015,
}
Tags: