Analyzing Walksat on random formulas

Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in polynomial time w.h.p. if m/n ≤ ρ · 2k /k for a certain constant ρ > 0. This is an improvement by a factor of Θ(k) over the best previous analysis of Walksat from [9]. Key words: random structures, phase transitions, k-SAT, local search algorithms.

• Type: Journal
• Year: 2011
• Where: CORR
• Authors: Amin Coja-Oghlan, Alan M. Frieze
• Keywords: CORR 2011, Education, Local Search Algorithms, Polynomial Time W.h.p, Random K-SAT Formula