Definability of semidefinite programming and lasserre lower bounds for CSPs.

Anuj Dawar Pengming Wang

Published in: LICS (2017)

Keyphrases

semidefinite
semidefinite programming
lower bound
constraint satisfaction problems
linear programming
upper bound
np hard
interior point methods
branch and bound
objective function
optimal solution
kernel matrix
worst case
maximum margin
search space
primal dual
feature selection
np complete
sat problem
max sat