Finding solutions to the Boolean satisfiability problem (SAT) in computer science can be costly due to its computational complexity. Im and Böhm et al. propose a SAT solver accelerator architecture using in-memory computing hardware to achieve a ~ 10 × speedup and a ~ 1000 × gain in energy efficiency.
- Haesol Im
- Fabian Böhm
- Ignacio Rozada
