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