Extended Formulation Lower Bounds for Refuting Random CSPs.
Jonah Brown-CohenPrasad RaghavendraPublished in: SODA (2020)
Keyphrases
- lower bound
- upper bound
- constraint satisfaction problems
- np hard
- constraint satisfaction
- branch and bound
- random instances
- branch and bound algorithm
- objective function
- lower and upper bounds
- search space
- linear programming relaxation
- finding optimal solutions
- vc dimension
- constraint propagation
- randomly generated
- temporal reasoning
- search algorithm