A New Term Rewriting Characterisation of ETIME functions
Logic in Computer Science
2013-12-31 v2 Computational Complexity
Abstract
Adopting former term rewriting characterisations of polytime and exponential-time computable functions, we introduce a new reduction order, the Path Order for ETIME (POE* for short), that is sound and complete for ETIME computable functions. The proposed reduction order for ETIME makes contrasts to those related complexity classes clear.
Cite
@article{arxiv.1312.7284,
title = {A New Term Rewriting Characterisation of ETIME functions},
author = {Martin Avanzini and Naohi Eguchi},
journal= {arXiv preprint arXiv:1312.7284},
year = {2013}
}
Comments
Technical report