基于模合成的多项式低误差多项式重对数n阶投影
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition
摘要:
我们发现,NP中的每一种语言都有一个PCP验证器,该验证器可以随机投掷$O(\log n)$硬币,具有完美的完全性,并且最多$1/\text{poly}(n)$的可靠性错误,同时在最多$n^{1/\text{poly}\log\log n}$的字母表上进行最多$O(\text{poly}\log\log n)$查询。获得$1/\text{poly}(n)$可靠性误差的先前构造使用$\text{poly}\log n $查询或指数大小的字母表,即,对于某些$c>0$,大小为$2^{n^c}$。我们的结果是两个参数同时呈指数级改善。我们的结果可以表述为多项式间隙硬度近似CSP的元$\text{poly}\log\log n$和字母大小$n^{1/\text{poly}\log n}$。在这个方向上,最终的目标是证明具有常数和多项式字母表大小的CSP的多项式硬度(也称为逆多项式可靠性误差的滑动尺度猜想)。我们的建设是基于模块化的推广以前的PCP建设在这个参数制度,它涉及到一个组成定理,使用一个额外的“一致性”查询,但保持健全的错误和字母表大小之间的逆多项式关系。我们的主要技术/概念的贡献是一个新的概念的健全性,我们称之为{ \em分布健全性},取代了以前的概念“列表解码健全性”,并允许我们证明一个模块化的组合定理,更严格的参数。这个新的可靠性概念允许我们调用组合的次数超常数,而不会导致可靠性错误的爆发。
英文摘要:
We show that every language in NP has a PCP verifier that tosses $O(\log n)$ random coins, has perfect completeness, and a soundness error of at most $1/\text{poly}(n)$, while making at most $O(\text{poly}\log\log n)$ queries into a proof over an alphabet of size at most $n^{1/\text{poly}\log\log n}$. Previous constructions that obtain $1/\text{poly}(n)$ soundness error used either $\text{poly}\log n $ queries or an exponential sized alphabet, i.e. of size $2^{n^c}$ for some $c>0$. Our result is an exponential improvement in both parameters simultaneously. Our result can be phrased as a polynomial-gap hardness for approximate CSPs with arity $\text{poly}\log\log n$ and alphabet size $n^{1/\text{poly}\log n}$. The ultimate goal, in this direction, would be to prove polynomial hardness for CSPs with constant arity and polynomial alphabet size (aka the sliding scale conjecture for inverse polynomial soundness error). Our construction is based on a modular generalization of previous PCP constructions in this parameter regime, which involves a composition theorem that uses an extra `consistency' query but maintains the inverse polynomial relation between the soundness error and the alphabet size. Our main technical/conceptual contribution is a new notion of soundness, which we refer to as {\em distributional soundness}, that replaces the previous notion of "list decoding soundness", and that allows us to prove a modular composition theorem with tighter parameters. This new notion of soundness allows us to invoke composition a super-constant number of times without incurring a blow-up in the soundness error.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。