arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.0837math.COcs.CCquant-ph
收藏

组合Optimization中多面体的指数下界

Exponential Lower Bounds for Polytopes in Combinatorial Optimization

Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf

摘要:

我们解决了一个20岁的问题所提出的Yannakakis和证明,不存在多项式大小的线性规划(LP)的相关多面体项目的旅行商多面体,即使LP不需要是对称的。此外,我们证明了这也适用于切割多面体和独立集多面体。这些结果是通过我们在单向量子通信协议和LP的半定规划重构之间建立的新联系发现的。

英文摘要:

We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size linear program (LP) whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric. Moreover, we prove that this holds also for the cut polytope and the stable set polytope. These results were discovered through a new connection that we make between one-way quantum communication protocols and semidefinite programming reformulations of LPs.

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

↑