Fetching the paper…
Reading the bibliography…
There has been a lot of interest recently in proving lower bounds on the size of linear programs needed to represent a given polytope P.
Expressing combinatorial optimization problems by linear programs
M. Yannakakis · 1991
Earlier work this paper cites.
On the distributional complexity of disjointness
A.A. Razborov · 1992
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X Goemans and David P Williamson · 1995
Earlier work this paper cites.
Geometry of cuts and metrics
Michel Marie Deza and Monique Laurent · 1997
Earlier work this paper cites.
Approximate graph coloring by semidefinite programming
David Karger, Rajeev Motwani, and Madhu Sudan · 1998
Earlier work this paper cites.
On polyhedral approximations of the second-order cone
Aharon Ben-Tal and Arkadi Nemirovski · 2001
Earlier work this paper cites.
Optimal algorithms and inapproximability results for every csp?
Prasad Raghavendra · 2008
Cited alongside, same era.
Expander flows, geometric embeddings and graph partitioning
Sanjeev Arora, Satish Rao, and Umesh Vazirani · 2009
Cited alongside, same era.
Smallest compact formulation for the permutahedron
Michel Goemans · 2009
Cited alongside, same era.
The design of approximation algorithms
David P Williamson and David B Shmoys · 2011
Cited alongside, same era.
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
S. Fiorini, S. Massar, S. Pokutta, H.R. Tiwary, and R. de Wolf · 2012
Cited alongside, same era.
Support-based lower bounds for the positive semidefinite rank of a nonnegative matrix
Troy Lee and Dirk Oliver Theis · 2012
On the connection of facially exposed and nice cones
Gábor Pataki · 2012
Later among the works it cites.
An information complexity approach to extended formulations
Mark Braverman and Ankur Moitra · 2013
Closest in time.
Common information and unique disjointness
Gábor Braun and Sebastian Pokutta · 2013
Closest in time.
Lifts of convex sets and cone factorizations
João Gouveia, Pablo A Parrilo, and Rekha R Thomas · 2013
Closest in time.
Efficient protocols for generating bipartite classical distributions and quantum states
R. Jain, Yaoyun Shi, Zhaohui Wei, and Shengyu Zhang · 2013
Closest in time.
A short proof that the extension complexity of the correlation polytope grows exponentially
Volker Kaibel and Stefan Weltge · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Closest in time.