所有语言的概率验证
Probabilistic verification of all languages
摘要：
我们提出了三个协议来验证所有的语言：（i）对于任何一元（二进制）语言，有一个对数空间（线性空间）的交互式证明系统（IPS）;（ii）对于任何语言，有一个恒定空间的弱IPS（非成员可能不会被拒绝的概率很高）;和，（iii）对于任何语言，有一个恒定空间的IPS与两个证明者，其中验证者读取输入一次。此外，我们表明，无数的二进制（一元）语言可以在恒定的空间和线性（二次）预期的时间进行验证。
英文摘要：
We present three protocols for verifying all languages: (i) For any unary (binary) language, there is a log-space (linear-space) interactive proof system (IPS); (ii) for any language, there is a constant-space weak-IPS (the non-members may not be rejected with high probability); and, (iii) for any language, there is a constant-space IPS with two provers where the verifier reads the input once. Additionally, we show that uncountably many binary (unary) languages can be verified in constant space and in linear (quadratic) expected time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
