多时间可计算函数的一个新的序论刻画
A New Order-theoretic Characterisation of the Polytime Computable Functions
摘要:
我们提出了一种新的顺序,小多项式路径顺序(简称sPOP*)。sPOP* 阶通过项重写系统提供了多项式时间可计算函数类的特征。任何多项式时间可计算函数都会产生与sPOP* 兼容的重写系统。另一方面,由与sPOP* 兼容的重写系统定义的任何函数都是多项式时间可计算的。从技术上讲,sPOP* 是一个驯服的递归路径顺序与产品状态。其显著特点是提供精确的控制。对于任何与sPOP* 兼容的重写系统,它使用递归直到深度d,(最内部的)运行时复杂度从上面由d次多项式限制。
英文摘要:
We propose a new order, the small polynomial path order (sPOP* for short). The order sPOP* provides a characterisation of the class of polynomial time computable function via term rewrite systems. Any polynomial time computable function gives rise to a rewrite system that is compatible with sPOP*. On the other hand any function defined by a rewrite system compatible with sPOP* is polynomial time computable. Technically sPOP* is a tamed recursive path order with product status. Its distinctive feature is the precise control provided. For any rewrite system that is compatible with sPOP* that makes use of recursion up to depth d, the (innermost) runtime complexity is bounded from above by a polynomial of degree d.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。