Recognizing more random unsatisfiable 3-SAT instances efficiently

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 + epsilon clauses. There epsilon > 0 is a constant.