activity
20132026
most citedA Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially

31 citations · 56 across the 21 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

math.CO2013★ 3 cited

Lower Bounds on the Sizes of Integer Programs Without Additional Variables

Volker Kaibel, Stefan Weltge

Let X be the set of integer points in some polyhedron. We investigate the smallest number of facets of any polyhedron whose set of integer points is X. This quantity, which we call…

math.CO2013★ 31 cited

A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially

Volker Kaibel, Stefan Weltge

We establish that the extension complexity of the nXn correlation polytope is at least 1.5^n by a short proof that is self-contained except for using the fact that every face of a…