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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
