Inferring Lower Bounds for Runtime Complexity

by Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
Reference:
Inferring Lower Bounds for Runtime Complexity (Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder), Technical report, RWTH Aachen, 2015.
Bibtex Entry:
@TechReport{FrohnGieslHenselAschermannStroeder15,
  author      = {Florian Frohn and J"urgen Giesl and Jera Hensel and Cornelius Aschermann and Thomas Str"oder},
  title       = {Inferring Lower Bounds for Runtime Complexity},
  institution = {RWTH Aachen},
  keywords    = {Term Rewriting, Runtime Complexity, Lower Bounds, Induction},
  year        = {2015},
  number      = {AIB-2015-05},
  month       = {February},
  url         = {http://aib.informatik.rwth-aachen.de/2015/2015-05.pdf}
}

Bookmark the permalink.