Načítá se...
Efficient solution of Boolean satisfiability problems with digital memcomputing
Boolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of research, instances of the SAT problem, as it is known, require efficient solution methods in a variety of applications. It is the decision prob...
Uloženo v:
| Vydáno v: | Sci Rep |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Nature Publishing Group UK
2020
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7665037/ https://ncbi.nlm.nih.gov/pubmed/33184386 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1038/s41598-020-76666-2 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|