Extended Formulation Lower Bounds for Refuting Random CSPs.
Jonah Brown-CohenPrasad RaghavendraPublished in: CoRR (2019)
Keyphrases
- lower bound
- upper bound
- constraint satisfaction problems
- random instances
- np hard
- linear programming relaxation
- objective function
- constraint programming
- branch and bound algorithm
- search space
- worst case
- constraint satisfaction
- constraint propagation
- vc dimension
- non binary
- binary csps
- decomposition method
- lower and upper bounds
- arc consistency
- optimal solution