On First-order Cons-free Term Rewriting and PTIME
Logic in Computer Science
2017-11-15 v2 Computational Complexity
Abstract
In this paper, we prove that (first-order) cons-free term rewriting with a call-by-value reduction strategy exactly characterises the class of PTIME-computable functions. We use this to give an alternative proof of the result by Carvalho and Simonsen which states that cons-free term rewriting with linearity constraints characterises this class.
Keywords
Cite
@article{arxiv.1711.03399,
title = {On First-order Cons-free Term Rewriting and PTIME},
author = {Cynthia Kop},
journal= {arXiv preprint arXiv:1711.03399},
year = {2017}
}
Comments
workshop proceedings for DICE 2016