利用小空间和随机性检验广义辩论
Checking generalized debates with small space and randomness
摘要:
我们引入了一个模型的概率辩论检查,一个沉默的资源有限的验证者阅读对话的成员资格的字符串在语言之间的证明者和反驳者之间的考虑。我们的模型结合并概括了单向交互式证明系统、不完全信息博弈和概率可检验的完全信息辩论系统的概念。我们考虑部分和零信息的辩论,证明者被阻止看到反驳者的部分或全部信息,以及完全信息的辩论。研究了在严格的记忆和随机性界限下,验证者可检验辩论的语言类。我们给出了这些类对应于O(1)空间和O(1)随机位,对数空间和多项式时间的同时界的版本的充分特征。事实证明,常数空间验证器只能确定性地检查正则语言的完全信息辩论,当允许使用常数数量的随机位时,可以检查P中任何语言的成员资格。类似的增长也发生在零信息和部分信息的辩论中,分别从NSPACE(n)到PSPACE,从E到EXPTIME。向这些恒定随机性验证器添加对数空间并不会改变它们的功效。当对数空间辩论检查器被限制在多项式时间内运行而没有随机位数的限制时,可辩论语言的类对于所有辩论类型都等于PSPACE。我们还提出了一个结果的硬度近似矩阵的量化最大字问题,这是一个推论的特征。
英文摘要:
We introduce a model of probabilistic debate checking, where a silent resource-bounded verifier reads a dialogue about the membership of the string in the language under consideration between a prover and a refuter. Our model combines and generalizes the concepts of one-way interactive proof systems, games of incomplete information, and probabilistically checkable complete-information debate systems. We consider debates of partial and zero information, where the prover is prevented from seeing some or all of the messages of the refuter, as well as those of complete information. The classes of languages with debates checkable by verifiers operating under severe bounds on the memory and randomness are studied. We give full characterizations of versions of these classes corresponding to simultaneous bounds of O(1) space and O(1) random bits, and of logarithmic space and polynomial time. It turns out that constant-space verifiers, which can only check complete-information debates for regular languages deterministically, can check for membership in any language in P when allowed to use a constant number of random bits. Similar increases also occur for zero- and partial- information debates, from NSPACE(n) to PSPACE, and from E to EXPTIME, respectively. Adding logarithmic space to these constant-randomness verifiers does not change their power. When logspace debate checkers are restricted to run in polynomial time without a bound on the number of random bits, the class of debatable languages equals PSPACE for all debate types. We also present a result on the hardness of approximating the quantified max word problem for matrices that is a corollary of this characterization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。