The backtracking survey propagation algorithm for solving random K-SAT problems
The K-satisfability problem is a combinatorial discrete optimization problem, which for K=3 is NP-complete, and whose random formulation is of interest for understanding computational complexity. Here, the authors introduce the backtracking survey propagation algorithm for studying it for K=3 and K=...
Guardado en:
Autores principales: | Raffaele Marino, Giorgio Parisi, Federico Ricci-Tersenghi |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Nature Portfolio
2016
|
Materias: | |
Acceso en línea: | https://doaj.org/article/719c06fe184d4189855a85415a4443c4 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances
por: Ernesto Campos, et al.
Publicado: (2021) -
The Micro‐Broadband Receiver (μBBR) on the Very‐Low‐Frequency Propagation Mapper CubeSat
por: Robert A. Marshall, et al.
Publicado: (2021) -
The localization of non-backtracking centrality in networks and its physical consequences
por: Romualdo Pastor-Satorras, et al.
Publicado: (2020) -
Non-backtracking walks reveal compartments in sparse chromatin interaction networks
por: K. Polovnikov, et al.
Publicado: (2020) -
Advanced arithmetic optimization algorithm for solving mechanical engineering design problems.
por: Jeffrey O Agushaka, et al.
Publicado: (2021)