Every exact affine semidefinite lift of the perfect-matching polytope of the complete graph on n vertices has matrix size at least 2^{c n} for some absolute c>0 and all sufficiently large even n.
Every exact affine semidefinite lift of the perfect-matching polytope of the complete graph on n vertices has matrix size at least 2^{c n} for some absolute c>0 and all sufficiently large even n.
Every exact affine semidefinite lift of the perfect-matching polytope of the complete graph on n vertices has matrix size at least 2^{c n} for some absolute c>0 and all sufficiently large even n.
If correct, rules out subexponential exact semidefinite formulations of the perfect-matching polytope without a symmetry assumption.
Must every exact semidefinite lift of the perfect-matching polytope have exponential size?
Publication dates and editorial changes.
OpenAI reports exponential semidefinite lift complexity for perfect matching
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
