Recognizing more random unsatisfiable 3-SAT instances efficiently

  • Goerdt A
  • Lanka A
  • 3


    Mendeley users who have this article in their library.
  • 10


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Andreas Goerdt

  • André Lanka

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free