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

0/1与线性规划的随机游动桥接

Bridging between 0/1 and Linear Programming via Random Walks

Joshua Brakensiek, Venkatesan Guruswami

摘要:

在强指数时间假设下,对于任何常数$c < 2$,一个带有$n$布尔值变量和$m$方程的整数线性规划不能在$c^n$时间内求解。如果将变量的域放宽到$[0,1]$,则相关的线性规划当然可以在多项式时间内求解。在这项工作中,我们给出了一个自然的算法之间的桥梁$0$ - $1$和线性规划的这些极端。具体来说,对于任何子集(有限的区间联盟)$E \subset [0,1]$包含$\{0,1\}$,我们给出了一个随机行走的算法与运行时$O_E((2-\text{measure}(E))^n\text{poly}(n,m))$,找到一个解决方案,在$E^n$的任何$n$变量线性规划与$m$的约束,是可行的$\{0,1\}^n$。请注意,随着$E$从$\{0,1\}$扩展到$[0,1]$,运行时从$2^n$平滑地改进为多项式。在我们的结果中取$E = [0,1/k) \cup (1-1/k,1]$作为推论,得到了$k$-SAT的随机$(2-2/k)^{n}\text{poly}(n)$时间算法.虽然我们的方法与Schöning的美丽算法有一些高度相似之处,但我们的通用算法基于更复杂的随机游走,其中包含几个新的成分,例如测量进展的乘法潜力,开始分布的明智选择,以及随机游走的演化的时变分布,其本身在每一步经由LP计算(基于极大极小定理保证其解)。将LP算法插入到我们早期的多态性框架中,可以为任何CSP(如$k$-SAT、$1$-in-$3$-SAT、NAE $k$-SAT)产生快速指数算法,这些CSP允许所谓的“阈值部分多态性”。'

英文摘要:

Under the Strong Exponential Time Hypothesis, an integer linear program with $n$ Boolean-valued variables and $m$ equations cannot be solved in $c^n$ time for any constant $c < 2$. If the domain of the variables is relaxed to $[0,1]$, the associated linear program can of course be solved in polynomial time. In this work, we give a natural algorithmic bridging between these extremes of $0$-$1$ and linear programming. Specifically, for any subset (finite union of intervals) $E \subset [0,1]$ containing $\{0,1\}$, we give a random-walk based algorithm with runtime $O_E((2-\text{measure}(E))^n\text{poly}(n,m))$ that finds a solution in $E^n$ to any $n$-variable linear program with $m$ constraints that is feasible over $\{0,1\}^n$. Note that as $E$ expands from $\{0,1\}$ to $[0,1]$, the runtime improves smoothly from $2^n$ to polynomial. Taking $E = [0,1/k) \cup (1-1/k,1]$ in our result yields as a corollary a randomized $(2-2/k)^{n}\text{poly}(n)$ time algorithm for $k$-SAT. While our approach has some high level resemblance to Schöning's beautiful algorithm, our general algorithm is based on a more sophisticated random walk that incorporates several new ingredients, such as a multiplicative potential to measure progress, a judicious choice of starting distribution, and a time varying distribution for the evolution of the random walk that is itself computed via an LP at each step (a solution to which is guaranteed based on the minimax theorem). Plugging the LP algorithm into our earlier polymorphic framework yields fast exponential algorithms for any CSP (like $k$-SAT, $1$-in-$3$-SAT, NAE $k$-SAT) that admit so-called `threshold partial polymorphisms.'

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

↑