重配置问题之间的保间隙归约
Gap Preserving Reductions Between Reconfiguration Problems
AI总结:
本文提出重配置不可近似性假设(RIH),并通过保间隙归约证明有界出现次数的Maxmin 3-SAT重配置及多种流行重配置问题的优化变体在PSPACE下难以近似。
摘要:
组合重配置是一个日益发展的研究领域,研究搜索问题的一对解之间的可变换性。我们考虑重配置问题的优化变体的可近似性;例如,对于一个布尔公式$φ$及其两个可满足的真值赋值$σ_{\sf s}$和$σ_{\sf t}$,Maxmin SAT Reconfiguration要求在从$σ_{\sf s}$变换到$σ_{\sf t}$的过程中最大化$φ$中被满足子句的最小比例。通过近似求解此类优化变体,我们可以获得一个由几乎满足的真值赋值组成的重配置序列。在本研究中,我们证明了一系列保间隙归约,以提供证据表明,在某个合理的假设下,大量重配置问题是PSPACE难近似的。我们的出发点是一个新的工作假设,称为重配置不可近似性假设(RIH),该假设断言Maxmin CSP Reconfiguration的间隙版本是PSPACE难的。该假设可以被视为PCP定理的重配置类比。我们的主要结果是,在RIH下,有界出现次数的Maxmin $3$-SAT Reconfiguration的近似是PSPACE难的。其证明的关键是一个从Maxmin Binary CSP Reconfiguration到其自身有界度数版本的保间隙归约。由于直接应用Papadimitriou和Yannakakis提出的使用扩展图的度数降低技术不能保持完美完备性,我们修改字母表,使得每个顶点仿佛可以同时取一对值。为了满足可靠性要求,我们进一步应用了一个显式的近Ramanujan图族和扩展混合引理。作为主要结果的一个应用,我们证明了在RIH下,流行的重配置问题的优化变体是PSPACE难近似的。
英文摘要:
Combinatorial reconfiguration is a growing research field studying problems on the transformability between a pair of solutions of a search problem. We consider the approximability of optimization variants of reconfiguration problems; e.g., for a Boolean formula $φ$ and two satisfying truth assignments $σ_{\sf s}$ and $σ_{\sf t}$ for $φ$, Maxmin SAT Reconfiguration requires to maximize the minimum fraction of satisfied clauses of $φ$ during transformation from $σ_{\sf s}$ to $σ_{\sf t}$. Solving such optimization variants approximately, we may obtain a reconfiguration sequence comprising almost-satisfying truth assignments. In this study, we prove a series of gap-preserving reductions to give evidence that a host of reconfiguration problems are PSPACE-hard to approximate, under some plausible assumption. Our starting point is a new working hypothesis called the Reconfiguration Inapproximability Hypothesis (RIH), which asserts that a gap version of Maxmin CSP Reconfiguration is PSPACE-hard. This hypothesis may be thought of as a reconfiguration analogue of the PCP theorem. Our main result is PSPACE-hardness of approximating Maxmin $3$-SAT Reconfiguration of bounded occurrence under RIH. The crux of its proof is a gap-preserving reduction from Maxmin Binary CSP Reconfiguration to itself of bounded degree. Because a simple application of the degree reduction technique using expander graphs due to Papadimitriou and Yannakakis does not preserve the perfect completeness, we modify the alphabet as if each vertex could take a pair of values simultaneously. To accomplish the soundness requirement, we further apply an explicit family of near-Ramanujan graphs and the expander mixing lemma. As an application of the main result, we demonstrate that under RIH, optimization variants of popular reconfiguration problems are PSPACE-hard to approximate.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。