4 search results - page 1 / 1 » Derandomization of Schuler's Algorithm for SAT |
SAT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
MST
2007
13 years 4 months ago
2007
In [Sch99], Sch¨oning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly...
JSAT
2006
13 years 4 months ago
2006
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. This algorithm uses the clauseshorte...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...