Performance of QAOA on Typical Instances of Constraint Satisfaction Problems with Bounded Degree.
Cedric Yen-Yu LinYechao ZhuPublished in: CoRR (2016)
Keyphrases
- constraint satisfaction problems
- finding optimal solutions
- constraint satisfaction
- pseudo boolean optimization
- random instances
- backtrack search
- np complete
- backtracking search
- constraint programming
- bounded degree
- tractable classes
- constraint propagation
- randomly generated
- bounded treewidth
- search space
- np hard
- combinatorial problems
- arc consistency
- forward checking
- sat problem
- binary csps
- soft constraints
- non binary
- constraint networks
- partial constraint satisfaction
- lower bound
- graph theoretic
- constraint problems
- backtracking algorithm
- phase transition
- symmetry breaking
- solving constraint satisfaction problems
- relational databases