Polynomial Path Orders

DOI10.2168/LMCS-9(4:9)2013zbMath1314.68170arXiv1309.2394OpenAlexW2053054452MaRDI QIDQ2865062

Martin Avanzini, Georg Moser

Publication date: 28 November 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.2394

zbMATH Keywords

term rewritingcomplexity analysisautomationimplicit computational complexity

Mathematics Subject Classification ID

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

Related Items (5)

A combination framework for complexity ⋮ Unnamed Item ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ Dependency Pairs and Polynomial Path Orders ⋮ A new order-theoretic characterisation of the polytime computable functions

Uses Software

• MiniSat
• SPEED

This page was built for publication: Polynomial Path Orders