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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2025 2verdicts
UNVERDICTED 2representative citing papers
A co-designed feasible-space local search heuristic for QAP that exploits single-shot neighborhood evaluation on IMC hardware while preserving feasibility.
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.
-
Hardware-Compatible Single-Shot Feasible-Space Heuristics for Solving the Quadratic Assignment Problem
A co-designed feasible-space local search heuristic for QAP that exploits single-shot neighborhood evaluation on IMC hardware while preserving feasibility.