researchers with a paper here
collaborating institutions
Showing cs.ETShow all

1 paper · 1 filter

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…