2SAT的紧凑线性规划
Compact linear programs for 2SAT
摘要:
对于每一个整数$n$,我们提出了一个明确的制定紧凑的线性规划,$O(n^3)$变量和约束,它确定了满足任何2SAT公式与$n$布尔变量由一个单一的线性最优化。这与由所有可满足公式及其满足赋值的凸包形成的自然多面体具有超多项式扩展复杂性的事实形成对比。我们的提法是基于多种商品的流动。我们还讨论了这些结果的稳定匹配问题的连接。
英文摘要:
For each integer $n$ we present an explicit formulation of a compact linear program, with $O(n^3)$ variables and constraints, which determines the satisfiability of any 2SAT formula with $n$ boolean variables by a single linear optimization. This contrasts with the fact that the natural polytope for this problem, formed from the convex hull of all satisfiable formulas and their satisfying assignments, has superpolynomial extension complexity. Our formulation is based on multicommodity flows. We also discuss connections of these results to the stable matching problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。