Linear vs semidefinite extended formulations: Exponential separation and strong lower bounds

2012

Presented at the Annual ACM Symposium on Theory of Computing

Additional Metadata
THEME	Life Sciences (theme 5), Logistics (theme 3)
Publisher	ACM
Project	Quantum Computer Science , Quantum computing: fault-tolerance, communication, and classical spin-offs
Conference	Annual ACM Symposium on Theory of Computing
Organisation	Algorithms and Complexity
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., & de Wolf, R. (2012). Linear vs semidefinite extended formulations: Exponential separation and strong lower bounds. In Proceedings of the 44th ACM STOC (pp. 95–106). ACM.

Publication