Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Wijesinghe, Parami, Liyanagedera, Chamika, Roy, Kaushik
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group UK 2018
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5932068/
https://www.ncbi.nlm.nih.gov/pubmed/29720596
http://dx.doi.org/10.1038/s41598-018-24877-z

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5932068/
https://www.ncbi.nlm.nih.gov/pubmed/29720596
http://dx.doi.org/10.1038/s41598-018-24877-z

Ejemplares similares