Complexity, Graphs, and the Dependency Pair Method

DOI10.1007/978-3-540-89439-1_45zbMath1182.68095OpenAlexW2112258778MaRDI QIDQ5505587

Georg Moser, Nao Hirokawa

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_45

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

A combination framework for complexity ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems ⋮ The Derivational Complexity Induced by the Dependency Pair Method ⋮ Analyzing innermost runtime complexity of term rewriting by dependency pairs

This page was built for publication: Complexity, Graphs, and the Dependency Pair Method