A carregar...

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

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Publicado no:Sci Rep
Main Authors: Wijesinghe, Parami, Liyanagedera, Chamika, Roy, Kaushik
Formato: Artigo
Idioma:Inglês
Publicado em: Nature Publishing Group UK 2018
Assuntos:
Acesso em linha:https://ncbi.nlm.nih.gov/pmc/articles/PMC5932068/
https://ncbi.nlm.nih.gov/pubmed/29720596
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1038/s41598-018-24877-z
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!