Guests (Theory of Combinatorial Algorithms, ETH Zürich)

Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Guests

Volker Kaibel, OVGU (Magdeburg, Germany), Jan 31
A Lower Bound on the Extension Complexity of the Correlation Polytope (Mittagsseminar, Jan 31)
Host: B. Gärtner