论文信息 - On First-order Cons-free Term Rewriting and PTIME

On First-order Cons-free Term Rewriting and PTIME

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.

Cynthia Kop

[1] Jakob Grue Simonsen,et al. Complexity Hierarchies and Higher-Order Cons-Free Rewriting , 2016, FSCD.

[2] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[3] Guillaume Bonfante. Some Programming Languages for Logspace and Ptime , 2006, AMAST.

[4] Jakob Grue Simonsen,et al. An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting , 2014, RTA-TLCA.