The Exact Hardness of Deciding Derivational and Runtime Complexity
From MaRDI portal
Publication:2915706
DOI10.4230/LIPICS.CSL.2011.481zbMath1247.03072OpenAlexW1480039477MaRDI QIDQ2915706
Andreas Schnabl, Jakob Grue Simonsen
Publication date: 18 September 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_7506.html
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Grammars and rewriting systems (68Q42)
This page was built for publication: The Exact Hardness of Deciding Derivational and Runtime Complexity