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.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below