3 papers
cs.ET2026
Accelerating Hybrid XORCNF Boolean Satisfiability Problems Natively with In-Memory Computing
Haesol Im, Fabian Böhm, Giacomo Pedretti +14
The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit desig…
cs.ET2025
Parallel Tempering-Inspired Distributed Binary Optimization with In-Memory Computing
Xiangyi Zhang, Fabian Böhm, Fabian Böhm +8
In-memory computing (IMC) has been shown to be a promising approach for solving binary optimization problems while significantly reducing energy and latency. Building on the advant…
cs.ET2025
Solving Boolean satisfiability problems with resistive content addressable memories
Giacomo Pedretti, Fabian Böhm, Tinish Bhattacharya +15
Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional…