Sum of squares lower bounds for refuting any CSP.
Pravesh K. KothariRyuhei MoriRyan O'DonnellDavid WitmerPublished in: CoRR (2017)
Keyphrases
- lower bound
- constraint satisfaction problems
- random instances
- np hard
- upper bound
- branch and bound
- branch and bound algorithm
- tree decomposition
- upper and lower bounds
- objective function
- finding optimal solutions
- constraint satisfaction
- lower and upper bounds
- constraint programming
- tree decompositions
- decomposition methods
- optimal solution
- worst case
- quadratic assignment problem
- constraint propagation
- randomly generated problems
- lower bounding
- vc dimension
- constraint solving
- dynamic time warping
- optimal cost
- closest string
- solving constraint satisfaction problems
- learning theory
- partial constraint satisfaction