FPIM: Field-Programmable Ising Machines for Solving SAT.
Thomas JagielskiRajit ManoharJaijeet RoychowdhuryPublished in: CoRR (2023)
Keyphrases
- phase transition
- sat solving
- np complete problems
- stochastic local search
- boolean optimization
- evolutionary algorithm
- low cost
- variable ordering
- satisfiability problem
- sat instances
- sat problem
- solving hard
- boolean satisfiability
- combinatorial optimization
- graph coloring
- search algorithm
- graphical models
- sat encodings
- markov random field
- upper bound
- lower bound