The Limits of SDP Relaxations for General-Valued CSPs.

Johan Thapper Stanislav Zivný

Published in: ACM Trans. Comput. Theory (2018)

Keyphrases

constraint propagation
constraint satisfaction problems
linear programming
constraint satisfaction
arc consistency
special case
np hard
search space
closely related
semidefinite programming
lower bound
semidefinite
feature selection