Some remarks on the survey decimation algorithm for K-satisfiability

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.

Cited by in corpus (2)

• Approximate analysis of search algorithms with "physical" methods
• Constraint Optimization and Statistical Mechanics