Login / Signup

On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity.

Jop BriëtDaniel DadushSebastian Pokutta
Published in: ESA (2013)
Keyphrases
  • semidefinite
  • complementarity problems
  • semidefinite programming
  • higher dimensional
  • convex relaxation
  • computational complexity
  • worst case
  • variational inequalities
  • convex hull
  • lower bound
  • denoising