Analyzing Runtime Complexity via Innermost Runtime Complexity

DOI10.29007/1nbhzbMath1403.68106OpenAlexW2613714534MaRDI QIDQ4645739

Florian Frohn, Jürgen Giesl

Publication date: 10 January 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.29007/1nbh

zbMATH Keywords

term rewritingevaluation strategiesautomated complexity analysis

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

This page was built for publication: Analyzing Runtime Complexity via Innermost Runtime Complexity