arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.07441cs.CCcs.DS
收藏

近最优字母-可靠性折衷PCPs

Near Optimal Alphabet-Soundness Tradeoff PCPs

Massachusetts Institute of Technology(麻省理工学院)

Dor Minzer, Kai Zhe Zheng

AI总结:

本文研究了2查询PCPs中字母大小与可靠性之间的近最优折衷,证明了在特定条件下区分投影游戏的NP难性,并推导出二次规划、2-CSPs及连通性问题的改进硬性结果。

摘要:

我们证明,对于所有ε>0,对于足够大的q∈自然数的2次幂,对于所有δ>0,区分给定的2-证人-1-轮投影游戏,其字母大小为q时价值至少为1-δ,或价值至多为1/q^{1-ε}是NP难的。这建立了2查询PCPs中字母大小与可靠性之间的近最优折衷,改进了Chan在2016年Journal of the ACM上的结果。我们的结果有以下 implications: 1) 对二次规划的近最优硬度:在准多项式时间归约下,给定布尔二次规划的价值近似因子为(log n)^{1 - o(1)}是NP难的。这改进了Khot和Safra在2013年的结果,并几乎匹配了由Megretski在2000年、Nemirovski等人在1999年以及Charikar和Wirth在2004年所达到的O(log n)近似比。2) 有界度2-CSPs:在随机归约下,对于足够大的d>0,近似2-CSPs的价值,其中每个变量出现在至多d个约束中,因子为(1-o(1))d/2是NP难的。这改进了Lee和Manurangsi在2024年的结果。3) 连通性问题的改进硬度结果:利用Laekhanukit在2014年和Manurangsi在2019年的结果,我们推导出了根k-连通性问题、顶点连通性生存网络设计问题和顶点连通性k-路线割问题的改进硬度结果。

英文摘要:

We show that for all $\varepsilon>0$, for sufficiently large $q\in\mathbb{N}$ power of $2$, for all $δ>0$, it is NP-hard to distinguish whether a given $2$-Prover-$1$-Round projection game with alphabet size $q$ has value at least $1-δ$, or value at most $1/q^{1-\varepsilon}$. This establishes a nearly optimal alphabet-to-soundness tradeoff for $2$-query PCPs with alphabet size $q$, improving upon a result of [Chan, Journal of the ACM 2016]. Our result has the following implications: 1) Near optimal hardness for Quadratic Programming: it is NP-hard to approximate the value of a given Boolean Quadratic Program within factor $(\log n)^{1 - o(1)}$ under quasi-polynomial time reductions. This improves upon a result of [Khot, Safra, ToC 2013] and nearly matches the performance of the best known algorithms due to [Megretski, IWOTA 2000], [Nemirovski, Roos, Terlaky, Mathematical Programming 1999] and [Charikar, Wirth, FOCS 2004] that achieve $O(\log n)$ approximation ratio. 2) Bounded degree $2$-CSPs: under randomized reductions, for sufficiently large $d>0$, it is NP-hard to approximate the value of $2$-CSPs in which each variable appears in at most $d$ constraints within factor $(1-o(1))\frac{d}{2}$, improving upon a result of [Lee, Manurangsi, ITCS 2024]. 3) Improved hardness results for connectivity problems: using results of [Laekhanukit, SODA 2014] and [Manurangsi, Inf. Process. Lett., 2019], we deduce improved hardness results for the Rooted $k$-Connectivity Problem, the Vertex-Connectivity Survivable Network Design Problem and the Vertex-Connectivity $k$-Route Cut Problem.

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

↑