不对称辩论的概率验证器
Probabilistic verifiers for asymmetric debates
摘要：
我们研究了沉默的恒定空间概率验证者的力量，他们观看两个确定性证明者之间的不对称辩论（其中一方无法看到另一方的一些信息），并试图确定谁是正确的。我们证明了概率验证优于他们的确定性同行作为不对称的辩论检查。证明了对于多项式有界空间可构造的s（n），NSPACE（s（n））中每种语言的成员问题都有一个2^{s（n）}时间的争论，其中一个证明者对另一个证明者是完全盲的.当残疾证明者可以看到部分信息时，在2^{s（n）}时间内可争论的语言类包含TIME（2^{s（n）}），因此概率有限自动机可以借助这样的争论在多项式时间内以小误差解决P中的任何决策问题。我们还比较了我们的系统与一个单一的证明，并与竞争证明互动证明系统。
英文摘要：
We examine the power of silent constant-space probabilistic verifiers that watch asymmetric debates (where one side is unable to see some of the messages of the other) between two deterministic provers, and try to determine who is right. We prove that probabilistic verifiers outperform their deterministic counterparts as asymmetric debate checkers. It is shown that the membership problem for every language in NSPACE(s(n)) has a 2^{s(n)}-time debate where one prover is completely blind to the other one, for polynomially bounded space constructible s(n). When partial information is allowed to be seen by the handicapped prover, the class of languages debatable in 2^{s(n)} time contains TIME(2^{s(n)}), so a probabilistic finite automaton can solve any decision problem in P with small error in polynomial time with the aid of such a debate. We also compare our systems with those with a single prover, and with competing-prover interactive proof systems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
