Complexity Analysis by Graph Rewriting

DOI10.1007/978-3-642-12251-4_19zbMath1284.68315OpenAlexW1516824726MaRDI QIDQ3558343

Martin Avanzini, Georg Moser

Publication date: 4 May 2010

Published in: Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12251-4_19

Mathematics Subject Classification ID

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

Related Items

A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems, A new order-theoretic characterisation of the polytime computable functions, Analyzing innermost runtime complexity of term rewriting by dependency pairs