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=...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Raffaele Marino, Giorgio Parisi, Federico Ricci-Tersenghi
Formato: article
Lenguaje:EN
Publicado: Nature Portfolio 2016
Materias:
Q
Acceso en línea:https://doaj.org/article/719c06fe184d4189855a85415a4443c4
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares