arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.06012cs.CCcs.DS
收藏

大建议量计算

Computation with Large Advice

Hiroki Morizumi

AI总结:

本文提出大建议量计算概念,证明常数空间图灵机配合多项式或拟多项式规模建议可分别包含非均匀NC^1或等于非均匀polyL,并尝试定义大建议量算法。

摘要:

本文考虑一种新的计算方向,我们称之为大建议量计算。我们主要研究图灵机中具有大建议量的常数空间计算,并证明以下事实:(i) 由具有多项式规模建议的常数空间图灵机可解的判定问题类包含非均匀 NC^1;(ii) 由具有拟多项式规模建议的常数空间图灵机可解的判定问题类等于非均匀 polyL。这些事实表明,具有大建议量的常数空间计算具有出乎意料的计算能力。另一方面,我们提及具有大建议量的有界时间计算,并尝试提出“大建议量算法”的概念。在该提议中,建议是针对某个问题和固定实例规模预先计算的数据,我们期望通过大或巨大的建议量获得高效算法。

英文摘要:

In this paper, we consider a new direction of computation, which we call computation with large advice. We mainly consider constant space computation with large advice in Turing machines, and prove the following facts: (i) The class of decision problems solvable by a constant space Turing machine with polynomial-size advice includes nonuniform-{\sf NC}$^1$, (ii) The class of decision problems solvable by a constant space Turing machine with quasipolynomial-size advice equals nonuniform-{\sf polyL}. The facts mean constant space computation with large advice has unexpected computational power. On the other hand, we mention bounded time computation with large advice, and attempt to propose a concept of ``algorithms with large advice''. In the proposal, advice is precomputed data for a problem and a fixed instance size, and we expect efficient algorithms by large or huge advice.

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

↑