A Path Order for Rewrite Systems that Compute Exponential Time Functions

Authors Martin Avanzini, Naohi Eguchi, Georg Moser

Thumbnail PDF


  • Filesize: 0.59 MB
  • 16 pages

Document Identifiers

Author Details

Martin Avanzini
Naohi Eguchi
Georg Moser

Cite AsGet BibTex

Martin Avanzini, Naohi Eguchi, and Georg Moser. A Path Order for Rewrite Systems that Compute Exponential Time Functions. In 22nd International Conference on Rewriting Techniques and Applications (RTA'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 10, pp. 123-138, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


In this paper we present a new path order for rewrite systems, the exponential path order EPO*. Suppose a term rewrite system is compatible with EPO*, then the runtime complexity of this rewrite system is bounded from above by an exponential function. Furthermore, the class of function computed by a rewrite system compatible with EPO* equals the class of functions computable in exponential time on a Turing machine.
  • Runtime Complexity
  • Exponential Time Functions
  • Implicit Computational Complexity


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads