A backtracking survey propagation algorithm for K-satisfiability

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.

9 pages, two figures

References in corpus (1)

• The Entropy of the K-Satisfiability Problem

Cited by in corpus (6)

• Survey propagation: an algorithm for satisfiability
• The backtracking survey propagation algorithm for solving random K-SAT problems
• Minimizing energy below the glass thresholds
• Clustering of solutions in hard satisfiability problems
• Constraint Optimization and Statistical Mechanics
• Statistical mechanics of optimization problems