Ontology highlight
ABSTRACT:
SUBMITTER: Wijesinghe P
PROVIDER: S-EPMC5932068 | biostudies-other | 2018 May
REPOSITORIES: biostudies-other
Wijesinghe Parami P Liyanagedera Chamika C Roy Kaushik K
Scientific reports 20180502 1
Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic Tunnel Junctions (MTJs). The inherent physics of MTJs, enhanced by device level modifications, is harnessed here to emulate the intricate dynamics of an analog satisfiability (SAT) solver. In the presence of thermal noise, the MTJ based system ca ...[more]