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

广义分支递归与多项式时间完备性

General Ramified Recurrence and Polynomial-time Completeness

Norman Danner, James S. Royer

摘要:

我们表现出一个健全的和完整的隐式复杂性形式主义的功能可行的计算结构递归归纳定义的数据结构。这里的可计算性意味着结构递归定义在输入表示的大小上以时间多项式运行,其中这些表示可以利用数据共享。这里归纳定义的数据结构包括列表和树。可靠性在这里意味着隐复杂性形式主义中的程序具有可行的运行时间。这里的完备性意味着每个由可行的结构递归计算的函数都有一个隐复杂性形式主义的程序。本文是一个后续工作的Avanzini,达尔拉戈,马提尼,和Zorzi谁专注于健全的形式主义,但没有考虑的问题的完整性。

英文摘要:

We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs in time polynomial in the size of the representation of the inputs where these representations may make use of data sharing. Inductively defined data structures here includes lists and trees. Soundness here means that the programs within the implicit-complexity formalism have feasible run times. Completeness here means that each function computed by a feasible structural recursion has a program in the implicit-complexity formalism. This paper is a follow up on the work of Avanzini, Dal Lago, Martini, and Zorzi who focused on the soundness of such formalisms but did not consider the question of completeness.

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

↑