On belief propagation guided decimation for random k-SAT

Details On belief propagation guided decimation for random k-SAT On belief propagation guided decimation for random k-SAT

2010-07-08

arxiv.org/abs/1007.1328v1

Mathematics

Combinatorics

Scientific paper

Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. Non-constructive arguments show that F is satisfiable for clause/variable ratios m/n< r(k)~2^k ln 2 with high probability. Yet no efficient algorithm is know to find a satisfying assignment for densities as low as m/n~r(k).ln(k)/k with a non-vanishing probability. In fact, the density m/n~r(k).ln(k)/k seems to form a barrier for a broad class of local search algorithms. One of the very few algorithms that plausibly seemed capable of breaking this barrier is a message passing algorithm called Belief Propagation Guided Decimation. It was put forward on the basis of deep but non-rigorous statistical mechanics considerations. Experiments conducted for k=3,4,5 suggested that the algorithm might succeed for densities very close to r_k. Furnishing the first rigorous analysis of BP decimation, the present paper shows that the algorithm fails to find a satisfying assignment already for m/n>c.r(k)/k, for a constant c>0 (independent of k).

Affiliated with

Also associated with

No associations

Rating

On belief propagation guided decimation for random k-SAT 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 On belief propagation guided decimation for random k-SAT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On belief propagation guided decimation for random k-SAT will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102705