activity
20182025
most citedMemristor-based hardware and algorithms for higher-order Hopfield optimization solver outperforming quadratic Ising machines

22 citations · 39 across the 6 of their papers we have counts for

collaborators
Showing 2025Show 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.ET2025★ 16 cited

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…