3 citations · 4 across the 5 of their papers we have counts for
Showing cs.ETShow all
2 papers · 1 filter
cs.ET2025
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.ET2024★ 3 cited
Parallel Tempering-Inspired Distributed Binary Optimization with In-Memory Computing
Xiangyi Zhang, Fabian Böhm, Elisabetta Valiante +7
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…