arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1209.3793cs.CC
收藏

多项式路序:一个极大模型

Polynomial Path Orders: A Maximal Model

Martin Avanzini, Georg Moser

摘要:

本文主要研究术语重写系统的自动复杂性分析及其在隐式计算复杂性理论中的衍生。我们引入了一种新的多集状态的路径序,多项式路径序POP*。本质上依赖于Bellantoni和Cook提出的谓词递归原则,其显著特征是对兼容TRS的资源的严格控制:兼容TRS的(最内层)运行时复杂度是多项式有界的。我们已经实现了这项技术,我们的实验证据支持我们的方法来自动运行时复杂性分析不仅是可行的,但与现有的方法相比,令人难以置信的快。作为ICC背景下的应用程序,我们提供了一个多时间可计算函数的序理论表征。确切地说,多时间可计算函数正是与POP* 兼容的正交构造器TRS可计算的函数。

英文摘要:

This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset status, the polynomial path order POP*. Essentially relying on the principle of predicative recursion as proposed by Bellantoni and Cook, its distinct feature is the tight control of resources on compatible TRSs: The (innermost) runtime complexity of compatible TRSs is polynomially bounded. We have implemented the technique, as underpinned by our experimental evidence our approach to the automated runtime complexity analysis is not only feasible, but compared to existing methods incredibly fast. As an application in the context of ICC we provide an order-theoretic characterisation of the polytime computable functions. To be precise, the polytime computable functions are exactly the functions computable by an orthogonal constructor TRS compatible with POP*.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑