collaborators

1 paper

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…