A backtracking survey propagation algorithm for K-satisfiability
Giorgio Parisi
Abstract
In this paper we present a backtracking version of the survey propagation algorithm. We show that the introduction of the simplest form of backtracking greatly improves the ability of the original survey propagation algorithm in solving difficult random problems near the sat-unsat transition.
Create a lesson
Related papers
Coupling spherical p-spin systems
Riccardo Cipolloni, Leticia F. Cugliandolo
Bias-Induced Crossover in Absolute Capacity of Dense Associative Memory
Yuto Sakurai, Takeaki Shimokawa, Kazunori Iwata et al.
Latent kinetic Ising models of neural spike trains
Davide Ghio, David Saad
Nonlocal Magic across the Many-Body Localization Crossover
Shan-Zhong Li, Zhi Li
Statistical levels and spatial modes of Fock-space heterogeneity in many-body localization crossovers
Yu-Jing Liu, Chen Cheng
Disorder-Tailored Delocalization
Yeongjun Kim, Supriyo Ghosh, Sergej Flach