Exponential lower bounds for polytopes in combinatorial optimization
|Other (theme 6)|
|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|
de Wolf, R.M. (2013, January). Exponential lower bounds for polytopes in combinatorial optimization.