Note on strong refutation algorithms for random k-SAT formulas

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.