A memristor-based in-memory computing accelerator natively embeds and solves hybrid XOR-CNF SAT problems, with simulations showing roughly 10x gains in speed, energy, and area over CNF translation methods and 1000x energy efficiency over CPU solvers.
Larrabee, Test pattern generation using boolean satisfiability, IEEE Transactions on Computer-Aided Design of Inte- grated Circuits and Systems, 11 (1992), pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.ET 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Accelerating Hybrid XOR$-$CNF Boolean Satisfiability Problems Natively with In-Memory Computing
A memristor-based in-memory computing accelerator natively embeds and solves hybrid XOR-CNF SAT problems, with simulations showing roughly 10x gains in speed, energy, and area over CNF translation methods and 1000x energy efficiency over CPU solvers.