The backtracking survey propagation algorithm for solving random K-SAT problems

Raffaele Marino, Giorgio Parisi, Federico Ricci-Tersenghi

Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very l…