A Quantum-Inspired Classical Solver for Boolean k-Satisfiability Problems.
S. Andrew LanhamBrian R. La CourPublished in: QCE (2021)
Keyphrases
- satisfiability problem
- quantum inspired
- binary gravitational search algorithm
- conjunctive normal form
- np complete
- quantum computing
- temporal logic
- phase transition
- search algorithm
- davis putnam logemann loveland
- sat problem
- immune clonal
- boolean formula
- boolean functions
- clause learning
- unit propagation
- stochastic local search
- quantum mechanics
- sat instances
- mutation operator
- max sat
- davis putnam
- computational complexity
- mazurkiewicz traces
- genetic algorithm
- special case
- orders of magnitude