arXiv · cond-mat/0308510
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Giorgio Parisi. 2003-08-25. A backtracking survey propagation algorithm for K-satisfiability. https://arxiv.org/abs/cond-mat/0308510
Cite the original work for its findings. Save a collection to share your selection of sources.