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

常空间、常随机性验证器与任意小误差

Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error

Boğaziçi University(博阿齐奇大学)

M. Utkan Gezer, A. C. Cem Say

AI总结:

研究常空间常随机性验证器在低误差验证NL子集的能力,通过线性时间多头非确定有限自动机实现任意小误差验证。

摘要:

我们研究了作为语言成员证书验证器的概率有限状态机的能力,特别是在验证器无论输入大小都必须掷固定非零数量硬币的 regime 中。Say 和 Yakaryılmaz 显示,误差界严格小于 1/2 的语言类恰好是 NL,但他们的构造导致在定义“误差”包括无限循环而不给出响应时,大多数 NL 中的语言误差界接近 1/2。我们刻画了一个子集 NL,其中通过这些极弱验证器可以实现任意低误差验证。对于任何 ε>0,可以构造一个常硬币、常空间验证器,对每个可由线性时间多头非确定有限自动机(2nfa(k))识别的语言,误差界为 ε。我们讨论了将此方法推广到 NL 的困难之处,并给出了将线性时间 2nfa(k) 的能力与 Turing 机定义的同时时间-空间复杂度类相关联的合理紧方法。

英文摘要:

We study the capabilities of probabilistic finite-state machines that act as verifiers for certificates of language membership for input strings, in the regime where the verifiers are restricted to toss some fixed nonzero number of coins regardless of the input size. Say and Yakaryılmaz showed that the class of languages that could be verified by these machines within an error bound strictly less than $1/2$ is precisely NL, but their construction yields verifiers with error bounds that are very close to $1/2$ for most languages in that class when the definition of "error" is strengthened to include looping forever without giving a response. We characterize a subset of NL for which verification with arbitrarily low error is possible by these extremely weak machines. It turns out that, for any $\varepsilon>0$, one can construct a constant-coin, constant-space verifier operating within error $\varepsilon$ for every language that is recognizable by a linear-time multi-head nondeterministic finite automaton (2nfa($k$)). We discuss why it is difficult to generalize this method to all of NL, and give a reasonably tight way to relate the power of linear-time 2nfa($k$)'s to simultaneous time-space complexity classes defined in terms of Turing machines.

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

↑