Some remarks on the survey decimation algorithm for K-satisfiability
Computational Complexity
2007-05-23 v1 Disordered Systems and Neural Networks
Data Structures and Algorithms
Abstract
In this note we study the convergence of the survey decimation algorithm. An analytic formula for the reduction of the complexity during the decimation is derived. The limit of the converge of the algorithm are estimated in the random case: interesting phenomena appear near the boundary of convergence.
Cite
@article{arxiv.cs/0301015,
title = {Some remarks on the survey decimation algorithm for K-satisfiability},
author = {Giorgio Parisi},
journal= {arXiv preprint arXiv:cs/0301015},
year = {2007}
}