Caricamento...
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...
Salvato in:
| Pubblicato in: | Sci Rep |
|---|---|
| Autori principali: | , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Nature Publishing Group UK
2018
|
| Soggetti: | |
| Accesso online: | 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: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|