2000 character limit reached
A New Term Rewriting Characterisation of ETIME functions (1312.7284v2)
Published 27 Dec 2013 in cs.LO and cs.CC
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.