Exponential lower bounds for polytopes in combinatorial optimization

Additional Metadata
THEME	Other (theme 6)
Note	TCS+ lecture Feb 6, 2013. TCS+ is an online seminar series in theoretical computer science, accessible to the widest possible audience, and ensuring a carbon-free dissemination of ideas across the globe.
Organisation	Algorithms and Complexity
Citation APA APA Style APA-ALL Style AAA 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	de Wolf, R. (2013). Exponential lower bounds for polytopes in combinatorial optimization.

Additional Files
Publisher Version

Publication