具有常数随机性的有限状态验证器
Finite state verifiers with constant randomness
摘要:
我们给出了一个新的表征$\mathsf{NL}$的语言类,其成员的证书,可以验证小错误在多项式时间有限状态机,使用一个常数的随机位,而不是其传统的描述中的确定性矩阵空间验证。事实证明,允许与证明者进行双向交互并不会改变可验证语言的类别,并且当用作语言识别器或公共硬币验证器时,没有多项式限制的随机性对恒定内存计算机有用。我们的主要结果的一个推论是,相应的O(log n)-空间有界游戏的不完全信息的通用玩家被允许一个常数的移动等于NL的结果问题的类。
英文摘要:
We give a new characterization of $\mathsf{NL}$ as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers. A corollary of our main result is that the class of outcome problems corresponding to O(log n)-space bounded games of incomplete information where the universal player is allowed a constant number of moves equals NL.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。