Login / Signup

The limits of SDP relaxations for general-valued CSPs.

Johan ThapperStanislav Zivný
Published in: LICS (2017)
Keyphrases
  • lower bound
  • special case
  • constraint satisfaction problems
  • closely related
  • semidefinite
  • neural network
  • learning algorithm
  • search space
  • np hard
  • constraint satisfaction
  • convex relaxation