Approximating Constraint Satisfaction Problems on High-Dimensional Expanders.
Vedat Levi AlevFernando Granha JeronimoMadhur TulsianiPublished in: CoRR (2019)
Keyphrases
- constraint satisfaction problems
- high dimensional
- constraint satisfaction
- constraint propagation
- search space
- constraint programming
- np hard
- combinatorial problems
- np complete
- finite domain
- constraint solving
- decomposition methods
- soft constraints
- constraint networks
- arc consistency
- constraint optimization
- forward checking
- partial constraint satisfaction
- computational problems
- product configuration
- non binary
- global constraints
- search algorithm
- graph based representations
- tractable subclasses
- weighted constraint satisfaction
- reasoning problems
- sat problem
- arc consistency algorithm
- arithmetic constraints
- graph coloring problems
- disjunctive temporal