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
Cell-type-specific modularity in E/I networks shapes dynamical regimes and computational capabilities
Emmanouil Giannakakis, Victor Buendía, Oleg Vinogradov et al.
Finite-width shift of the edge of chaos in deep neural networks
Arn Caesar
Neural Networks with Exciton-Polariton Waveguides
Huawen Xu, Ruiqi Bao, Lingyu Tian et al.
Optical Ceiling on Polaron Mobility in Disordered Molecular Semiconductors: Lessons from Eumelanin
Alvan Hunt
Glauber dynamics of the Sherrington--Kirkpatrick spin-glass model: a dynamical cavity method
Grzegorz Szamel
Generative diffusion in long-range correlated landscapes: Speciation cascade and the foam structure of the score
Jerome Garnier-Brun, Giulio Biroli, Marc Mézard et al.