Login / Signup
On the existence of 0/1 polytopes with high semidefinite extension complexity.
Jop Briët
Daniel Dadush
Sebastian Pokutta
Published in:
Math. Program. (2015)
Keyphrases
</>
semidefinite
complementarity problems
semidefinite programming
sufficient conditions
convex relaxation
interior point methods
variational inequalities
computational complexity
dynamic programming
worst case
principal component analysis