The matching polytope has exponential extension complexity
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a polynomial. After two decades of standstill, recent years have brought amazing progress in showing lower bounds for the so called extension complexity.
However, the central question in this field remained wide open: can the perfect matching polytope be written as an LP with polynomially many constraints?
We answer this question negatively. In fact, the extension complexity of the perfect matching polytope in a complete n-node graph is 2Omega(n).
Speaker Details
Thomas Rothvoss did his PhD in Mathematics in 2009 at EPFL in Switzerland under Friedrich Eisenbrand. Then he was a PostDoc at MIT working with Michel Goemans. Since January 2014 he is assistant professor in the Department of Mathematics at UW Seattle.
- Series:
- Microsoft Research Talks
- Date:
- Speakers:
- Thomas Rothvoss
- Affiliation:
- University of Washington
Series: Microsoft Research Talks
-
DIABLo: a Deep Individual-Agnostic Binaural Localizer
Speakers:- Shoken Kaneko
-
A Tale of Two Cities: Software Developers in Practice During the COVID-19 Pandemic
Speakers:- Denae Ford Robinson
-
Recent Efforts Towards Efficient And Scalable Neural Waveform Coding
Speakers:- Kai Zhen
-
-
Audio-based Toxic Language Detection
Speakers:- Midia Yousefi
-
What Kind of Computation is Human Cognition? A Brief History of Thought (Episode 2/2)
Speakers:- Paul Smolensky
-
From SqueezeNet to SqueezeBERT: Developing Efficient Deep Neural Networks
Speakers:- Forrest Iandola,
- Sujeeth Bharadwaj
-
Hope Speech and Help Speech: Surfacing Positivity Amidst Hate
Speakers:- Ashique Khudabukhsh
-
What Kind of Computation is Human Cognition? A Brief History of Thought (Episode 1/2)
Speakers:- Paul Smolensky
-
An Ethical Crisis in Computing?
Speakers:- Eric Horvitz,
- Moshe Y. Vardi
-
Towards Mainstream Brain-Computer Interfaces (BCIs)
Speakers:- Brendan Allison
-
-
'F' to 'A' on the N.Y. Regents Science Exams: An Overview of the Aristo Project
Speakers:- Peter Clark
-
Checkpointing the Un-checkpointable: the Split-Process Approach for MPI and Formal Verification
Speakers:- Gene Cooperman
-
Learning Structured Models for Safe Robot Control
Speakers:- Subramanian Ramamoorthy
-
Non-linear Invariants for Control-Command Systems
Speakers:- Pierre Roux
-
Distributed Entity Resolution for Computational Social Science
Speakers:- Rebecca C. Steorts
-
The Worst Form Including All Those Others: Canada’s Experiments with Online Voting
Speakers:- Aleksander Essex
-
How Not to Prove Your Election Outcome
Speakers:- Vanessa Teague
-
Dashboard Mechanisms for Online Marketplaces
Speakers:- Jason Hartline
-
Compacting the Uncompactable: The Mesh Compacting Memory Allocator
Speakers:- Emery Berger
-
Tea: A High-level Language and Runtime System for Automating Statistical Analysis
Speakers:- Eunice Jun
-
Resource-Efficient Redundancy for Large-Scale Data Processing and Storage Systems
Speakers:- Rashmi Vinayak
-
Battling Unfair Demons in Peer Review
Speakers:- Nihar Shah
-
Sequential Estimation of Quantiles with Applications to A/B-testing and Best-arm Identification
Speakers:- Aaditya Ramdas