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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, January 31, 2019, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Volker Kaibel (OVGU)

A Lower Bound on the Extension Complexity of the Correlation Polytope

The extension complexity of a polytope is the smallest number of facets of any polyhedron of which it is a linear projection. In a seminal paper Fiorini, de Wolf, Massar, Pokutta, and Tiwary (2012) established an exponential lower bound on the extension complexity of the correlation polytope, implying corresponding lower bounds for several other polytopes such as the traveling salesman polytope. In this talk we present a very simple and hopefully pleasing proof that establishes the currently best known lower bound (3/2)^n on the extension complexity of the correlation polytope for n variables. The talk is based on joint work with Stefan Weltge.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login