29.2 Snap-SAT: A One-Shot Energy-Performance-Aware All-Digital Compute-in-Memory Solver for Large-Scale Hard Boolean Satisfiability Problems

Boolean satisfiability (SAT) is a non-deterministic polynomial time (NP)-complete problem with many practical and industrial data-intensive applications [1]. Examples (Fig. 29.2.1) include anti-aircraft mission planning in defense, gene prediction in vaccine development, network routing in the data...

Full description

Bibliographic Details

Published in:	Digest of technical papers - IEEE International Solid-State Circuits Conference pp. 420 - 422
Main Authors:	Xie, Shanshan, Yang, Mengtian, Lanham, S. Andrew, Wang, Yipeng, Wang, Meizhi, Oruganti, Sirish, Kulkarni, Jaydeep P.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 19.02.2023
Subjects:	Costs Hardware Memory management Model checking Random access memory Routing Software
ISSN:	2376-8606
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!