Abstract
Abstract 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
