Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
Vicky ChoiPublished in: CoRR (2010)
Keyphrases
- maximum weight
- independent set
- np complete
- sat problem
- randomly generated
- computational complexity
- np complete problems
- np hard
- satisfiability problem
- orders of magnitude
- bipartite graph
- data structure
- minimum weight
- partial order
- phase transition
- constraint satisfaction problems
- search strategies
- query processing
- learning algorithm