Beating the random assignment on constraint satisfaction problems of bounded degree.
Boaz BarakAnkur MoitraRyan O'DonnellPrasad RaghavendraOded RegevDavid SteurerLuca TrevisanAravindan VijayaraghavanDavid WitmerJohn WrightPublished in: CoRR (2015)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- random instances
- constraint programming
- bounded degree
- np complete
- search space
- arc consistency
- binary csps
- non binary
- constraint networks
- combinatorial problems
- constraint solving
- soft constraints
- np hard
- graph theoretic
- bounded treewidth
- randomly generated
- partial constraint satisfaction
- path consistency
- constraint problems
- constraint solver
- backtracking search
- pseudo boolean optimization
- social networks
- forward checking
- configuration problems
- tractable classes
- phase transition