Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds

@inproceedings{Fiorini2012LinearVS,
  title={Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds},
  author={Samuel Fiorini and Serge Massar and Sebastian Pokutta and Hans Raj Tiwary and Ronald de Wolf},
  booktitle={STOC},
  year={2012}
}
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. 
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 105 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Extended formulations

  • Y. Faenza, S. Fiorini, R. Grappe, H. R. Tiwary
  • non-negative factorizations and randomized…
  • 2011
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…