Cargando…
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...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Nature Publishing Group UK
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7665037/ https://www.ncbi.nlm.nih.gov/pubmed/33184386 http://dx.doi.org/10.1038/s41598-020-76666-2 |