Some remarks on the survey decimation algorithm for K-satisfiability

Details Some remarks on the survey decimation algorithm for K-satisfiability Some remarks on the survey decimation algorithm for K-satisfiability

2003-01-16

arxiv.org/abs/cs/0301015v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Some remarks on the survey decimation algorithm for K-satisfiability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some remarks on the survey decimation algorithm for K-satisfiability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some remarks on the survey decimation algorithm for K-satisfiability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-535092