ACM Symposium on Theory of Computing, STOC 2014


Article Details
Title: The matching polytope has exponential extension complexity
Article URLs:
Alternative Article URLs:
Authors: Thomas Rothvoß
  • University of Washington Seattle, USA
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1115849
DBLP Key: conf/stoc/Rothvoss14
Author Comments:

Discuss this paper and its artifacts below