Implementing 3-SAT Gadgets for Quantum Annealers with Random Instances.
Pol Rodríguez-FarrésRocco BallesterCarlos AnsóteguiJordi LevyJesús CerquidesPublished in: ICCS (6) (2024)
Keyphrases
- random instances
- phase transition
- sat instances
- np complete problems
- sat problem
- satisfiability problem
- randomly generated
- sat solvers
- random constraint satisfaction problems
- np complete
- constraint satisfaction
- constraint satisfaction problems
- graph coloring
- search problems
- combinatorial problems
- lower bound
- hard problems
- boolean satisfiability
- polynomial size
- random graphs
- orders of magnitude
- propositional satisfiability
- evolutionary algorithm
- computational complexity
- boolean functions
- max sat
- cellular automata
- search space