arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1704.01405cs.CC
收藏

多项式时间oracle机的多项式运行时间

Polynomial running times for polynomial-time oracle machines

Akitoshi Kawamura, Florian Steinberg

摘要:

本文在Baire空间上引入了一个比二阶复杂性理论所建立的概念更具限制性的可行性概念。因此,可以将自然数上的函数视为oracle图灵机的运行时间,并避免二阶多项式,这是众所周知的难以处理。此外,所有证明这种更强可行性的机器都可以被计时,并且从可计算分析和二阶复杂性理论中处理部分运算符的不同传统在精确意义上是等同的。新的概念被命名为“强多项式时间可计算性”,并证明是一个严格强于多项式时间可计算性的要求。证明了在Kawamura和Cook引入的算子复杂性分析框架内,强多项式时间可计算算子和多项式时间可计算算子是一致的.

英文摘要:

This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of oracle Turing machines and avoiding second-order polynomials, which are notoriously difficult to handle. Furthermore, all machines that witness this stronger kind of feasibility can be clocked and the different traditions of treating partial operators from computable analysis and second-order complexity theory are equated in a precise sense. The new notion is named "strong polynomial-time computability", and proven to be a strictly stronger requirement than polynomial-time computability. It is proven that within the framework for complexity of operators from analysis introduced by Kawamura and Cook the classes of strongly polynomial-time computable operators and polynomial-time computable operators coincide.

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

↑