Inferring Lower Bounds for Runtime Complexity

DOI10.4230/LIPIcs.RTA.2015.334zbMath1366.68116OpenAlexW2296265259MaRDI QIDQ5277889

Cornelius Aschermann, Jürgen Giesl, Florian Frohn, Jera Hensel, Thomas Ströder

Publication date: 12 July 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.RTA.2015.334

zbMATH Keywords

lower boundsinductionterm rewritingruntime complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Related Items (4)

Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ Lower bounds for runtime complexity of term rewriting ⋮ Lower Runtime Bounds for Integer Programs

Uses Software

• AProVE

This page was built for publication: Inferring Lower Bounds for Runtime Complexity