arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.13073cs.CC
收藏

从非唯一对策到布尔唯一对策的约简

Reduction From Non-Unique Games To Boolean Unique Games

Ronen Eldan, Dana Moshkovitz

摘要:

我们将证明一个“布尔唯一博弈猜想”的问题(对于任何C> 1,有1-delta与1-C*delta的差距,并且足够小的delta>0)简化为证明一个非唯一博弈的PCP定理的问题。在以前的工作中,Khot和Moshkovitz提出了一种低效的候选减少(即,没有可靠性的证明)。目前的工作是第一次提供一个有效的减少,以及稳健性的证明。非唯一的游戏,我们减少是类似的非唯一的游戏,PCP定理是已知的。我们的证明依赖于一个新的浓度定理的函数在高斯空间中,限制到一个随机超平面。我们将函数对超平面的限制的低次部分与函数的低次部分对超平面的限制之间的典型欧氏距离绑定。

英文摘要:

We reduce the problem of proving a "Boolean Unique Games Conjecture" (with gap 1-delta vs. 1-C*delta, for any C> 1, and sufficiently small delta>0) to the problem of proving a PCP Theorem for a certain non-unique game. In a previous work, Khot and Moshkovitz suggested an inefficient candidate reduction (i.e., without a proof of soundness). The current work is the first to provide an efficient reduction along with a proof of soundness. The non-unique game we reduce from is similar to non-unique games for which PCP theorems are known. Our proof relies on a new concentration theorem for functions in Gaussian space that are restricted to a random hyperplane. We bound the typical Euclidean distance between the low degree part of the restriction of the function to the hyperplane and the restriction to the hyperplane of the low degree part of the function.

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

↑