Analyzing Walksat on random formulas
Combinatorics
2017-11-17 v2 Discrete Mathematics
Abstract
Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from Papadimitriou (FOCS 1991)/Schoning (FOCS 1999) finds a satisfying assignment of F in polynomial time w.h.p. if m/n<\rho 2^k/k for a certain constant \rho>0. This is an improvement by a factor of over the best previous analysis of Walksat from Coja-Oghlan, Feige, Frieze, Krivelevich, Vilenchik (SODA 2009).
Cite
@article{arxiv.1106.0120,
title = {Analyzing Walksat on random formulas},
author = {Amin Coja-Oghlan and Alan Frieze},
journal= {arXiv preprint arXiv:1106.0120},
year = {2017}
}