Different Adiabatic Quantum Optimization Algorithms for the NP-Complete Exact Cover and 3SAT Problems
Vicky ChoiPublished in: CoRR (2010)
Keyphrases
- np complete
- sat problem
- np complete problems
- satisfiability problem
- optimization problems
- orders of magnitude
- randomly generated
- computational complexity
- combinatorial optimization
- phase transition
- stochastic local search
- polynomial time complexity
- sat solvers
- propositional satisfiability
- solving hard
- maximum satisfiability