3 papers
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…
cond-mat.dis-nn2024
Energy landscapes of combinatorial optimization in Ising machines
Dmitrii Dobrynin, Adrien Renaudineau, Mohammad Hizzani +3
Physics-based Ising machines (IM) have been developed as dedicated processors for solving hard combinatorial optimization problems with higher speed and better energy efficiency. G…
cs.ET2023
Memristor-based hardware and algorithms for higher-order Hopfield optimization solver outperforming quadratic Ising machines
Mohammad Hizzani, Arne Heittmann, George Hutchinson +6
Ising solvers offer a promising physics-based approach to tackle the challenging class of combinatorial optimization problems. However, typical solvers operate in a quadratic energ…