  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.
