A carregar...
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...
Na minha lista:
| Publicado no: | Sci Rep |
|---|---|
| Main Authors: | , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Nature Publishing Group UK
2020
|
| Assuntos: | |
| Acesso em linha: | 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 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|