Snap-SAT: A One-Shot Energy-Performance-Aware All-Digital Compute-in-Memory Solver for Large-Scale Hard Boolean Satisfiability Problems.
Shanshan XieMengtian YangS. Andrew LanhamYipeng WangMeizhi WangSirish OrugantiJaydeep P. KulkarniPublished in: ISSCC (2023)
Keyphrases
- satisfiability problem
- conjunctive normal form
- davis putnam logemann loveland
- sat problem
- np complete
- random sat
- search algorithm
- graph coloring problems
- boolean formula
- temporal logic
- phase transition
- unit propagation
- stochastic local search algorithms
- clause learning
- sat instances
- stochastic local search
- sat solving
- solving hard
- max sat
- boolean satisfiability
- davis putnam
- weighted max sat
- first order logic
- model checking
- sat solvers