Solving Boolean Satisfiability with Stochastic Nanomagnets.
Maeesha Binte HashemNastaran DarabiSupriyo BandyopadhyayAmit Ranjan TrivediPublished in: ICECS 2022 (2022)
Keyphrases
- boolean satisfiability
- boolean optimization
- sat solving
- sat solvers
- probabilistic planning
- integer linear programming
- branch and bound algorithm
- random sat instances
- sat problem
- sat instances
- randomly generated
- symmetry breaking
- boolean formula
- davis putnam logemann loveland
- max sat
- combinatorial problems
- orders of magnitude
- genetic algorithm
- combinatorial optimization
- constraint satisfaction
- np complete