Note on strong refutation algorithms for random k-SAT formulas

Abstract We present a simple strong refutation algorithm for random k-SAT formulas. Our algorithm applies to random k-SAT formulas on n variables with ω ( n ) n ( k + 1 ) / 2 clauses for any ω ( n ) → ∞ . In contrast to the earlier results of Coja-Oghlan, Goerdt, and Lanka (for k = 3 , 4) and Coja-Oghlan, Cooper, and Frieze (for k ⩾ 5 ), which address the same problem for even sparser formulas our algorithm is more elementary.

[1]  Amin Coja-Oghlan,et al.  An efficient regularity concept for sparse graphs and matrices , 2009 .

[2]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[3]  Uriel Feige,et al.  Easily Refutable Subformulas of Large Random 3CNF Formulas , 2004, ICALP.

[4]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[5]  Uriel Feige,et al.  Witnesses for non-satisfiability of dense random 3CNF formulas , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[6]  Amin Coja-Oghlan,et al.  Strong Refutation Heuristics for Random k-SAT , 2004, APPROX-RANDOM.

[7]  Uriel Feige,et al.  Easily refutable subformulas of large random 3CNF formulas , 2004, Theory of Computing.