Closing the Gap Between Runtime Complexity and Polytime Computability

Authors Martin Avanzini, Georg Moser

Thumbnail PDF


  • Filesize: 206 kB
  • 16 pages

Document Identifiers

Author Details

Martin Avanzini
Georg Moser

Cite AsGet BibTex

Martin Avanzini and Georg Moser. Closing the Gap Between Runtime Complexity and Polytime Computability. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics (LIPIcs), Volume 6, pp. 33-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


In earlier work, we have shown that for confluent TRSs, innermost polynomial runtime complexity induces polytime computability of the functions defined. In this paper, we generalise this result to full rewriting, for that we exploit graph rewriting. We give a new proof of the adequacy of graph rewriting for full rewriting that allows for a precise control of the resources copied. In sum we completely describe an implementation of rewriting on a Turing machine (TM for short). We show that the runtime complexity of the TRS and the runtime complexity of the TM is polynomially related. Our result strengthens the evidence that the complexity of a rewrite system is truthfully represented through the length of derivations. Moreover our result allows the classification of nondeterministic polytime-computation based on runtime complexity analysis of rewrite systems.
  • Term rewriting
  • graph rewriting
  • complexity analysis
  • polytime computability


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