Beating the random assignment on constraint satisfaction problems of bounded degree.
Boaz BarakAnkur MoitraRyan O'DonnellPrasad RaghavendraOded RegevDavid SteurerLuca TrevisanAravindan VijayaraghavanDavid WitmerJohn WrightPublished in: Electron. Colloquium Comput. Complex. (2015)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- random instances
- constraint propagation
- np complete
- constraint programming
- bounded degree
- search space
- combinatorial problems
- binary csps
- non binary
- constraint solving
- np hard
- soft constraints
- forward checking
- constraint networks
- arc consistency
- graph theoretic
- sat problem
- constraint problems
- search algorithm
- randomly generated
- phase transition