Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
Threshold values of random K-SAT from the cavity method
Random Structures & Algorithms
Random $k$-SAT: Two Moments Suffice to Cross a Sharp Threshold
SIAM Journal on Computing
Pairs of SAT-assignments in random Boolean formulæ
Theoretical Computer Science
Algorithmic Barriers from Phase Transitions
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Message-passing and local heuristics as decimation strategies for satisfiability
Proceedings of the 2009 ACM symposium on Applied Computing
Random Formulas Have Frozen Variables
SIAM Journal on Computing
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
On the solution-space geometry of random constraint satisfaction problems
Random Structures & Algorithms
On belief propagation guided decimation for random k-SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Non-rigorous statistical mechanics ideas have inspired a message passing algorithm called Belief propagation guided decimation for finding satisfying assignments of random k-SAT instances. This algorithm can be viewed as an attempt at implementing a certain thought experiment that we call the decimation process. In this paper we identify a variety of phase transitions in the decimation process and link these phase transitions to the performance of the algorithm.