The matching polytope has exponential extension complexity

Thomas Rothvoß. The matching polytope has exponential extension complexity. In David B. Shmoys, editor, Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014. pages 263-272, ACM, 2014. [doi]

Abstract

Abstract is missing.