Theoretical computer science · Oct 6, 2026
Exponential semidefinite complexity of perfect matching
Proves that every exact semidefinite lift of the perfect matching polytope has exponential size, answering Rothvoss's polynomial-size lift question negatively. The bound holds even for the positive semidefinite rank of its odd-cut slack matrix after any fixed shift , allowing arbitrary real positive semidefinite factors.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model