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]
@inproceedings{Rothvoss14,
title = {The matching polytope has exponential extension complexity},
author = {Thomas Rothvoß},
year = {2014},
doi = {10.1145/2591796.2591834},
url = {http://doi.acm.org/10.1145/2591796.2591834},
researchr = {https://researchr.org/publication/Rothvoss14},
cites = {0},
citedby = {0},
pages = {263-272},
booktitle = {Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014},
editor = {David B. Shmoys},
publisher = {ACM},
isbn = {978-1-4503-2710-7},
}