Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions
Abstract 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...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Nature Portfolio
2018
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/c3e6a1b8ed9e493b9d85cbc2bf45a2c6 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|