We present a simple randomized algorithm for SAT and prove an upper bound on its running time. Given a Boolean formula F in conjunctive normal form, the algorithm finds a satisfying assignment for F (if any) by repeating the following: Choose an assignment A at random and search for a ... more >>>

We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most $2^{n(1-1/\alpha)}$ up to a polynomial factor, where $\alpha = \ln(m/n) + O(\ln \ln m)$ and $n$, $m$ are respectively the number of variables ... more >>>