A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)
Computational Complexity
2011-06-10 v3
Abstract
In this paper we present a new path order for rewrite systems, the exponential path order EPOSTAR. Suppose a term rewrite system is compatible with EPOSTAR, 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 EPOSTAR equals the class of functions computable in exponential time on a Turing maschine.
Cite
@article{arxiv.1010.1128,
title = {A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)},
author = {Martin Avanzini and Naohi Eguchi and Georg Moser},
journal= {arXiv preprint arXiv:1010.1128},
year = {2011}
}
Comments
Technical Report