Cargando...
The backtracking survey propagation algorithm for solving random K-SAT problems
Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances. Moreover, it is still unclear what are the key features that make a discrete combinatorial optimization...
Guardado en:
| Publicado en: | Nat Commun |
|---|---|
| Autores principales: | , , |
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Nature Publishing Group
2016
|
| Materias: | |
| Acceso en línea: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5063968/ https://ncbi.nlm.nih.gov/pubmed/27694952 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1038/ncomms12996 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|