We show that random 3-SAT formulas with poly(log n).n3/2= n3/2 + o(1)clauses can be efficiently certified as unsatisfiable. This improves a previous bound of n3/2 + epsilonclauses. There epsilon > 0 is a constant. © 2003.
Goerdt, A., & Lanka, A. (2003). Recognizing more random unsatisfiable 3-SAT instances efficiently. Electronic Notes in Discrete Mathematics, 16, 21–46. https://doi.org/10.1016/S1571-0653(04)00461-5