Derandomization of Schuler's Algorithm for SAT

Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most $2^{n(1-1/{\rm log}_{2}(2m))}$ up to a polynomial factor, where n and m are, respectively, the number of variables and the number of clauses in the input formula. This bound is the best known upper bound for testing satisfiability of formulas in CNF with no restriction on clause length (for the case when m is not too large comparing to n). We derandomize this algorithm using deterministic k-SAT algorithms based on search in Hamming balls, and we prove that our deterministic algorithm has the same upper bound on the running time as Schuler’s randomized algorithm.

[1]  Pavel Pudlák,et al.  Satisfiability - Algorithms and Logic , 1998, MFCS.

[2]  Oliver Kullmann,et al.  New Methods for 3-SAT Decision and Worst-case Analysis , 1999, Theor. Comput. Sci..

[3]  Pavel Pudlák,et al.  Satisfiability Coding Lemma , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[4]  Uwe Schöning,et al.  A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart , 2002, Algorithmica.

[5]  Evgeny Dantsin,et al.  Algorithms for SAT Based on Search in Hamming Balls , 2004, STACS.

[6]  Michael E. Saks,et al.  An improved exponential-time algorithm for k-SAT , 2005, JACM.

[7]  Kazuo Iwama,et al.  Improved upper bounds for 3-SAT , 2004, SODA '04.

[8]  Uwe Schöning.  A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems , 1999, FOCS.

[9]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[10]  Jon M. Kleinberg,et al.  A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search , 2002, Theor. Comput. Sci..

[11]  Rainer Schuler,et al.  Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs , 2003, SAT.

[12]  Rainer Schuler,et al.  An algorithm for the satisfiability problem of formulas in conjunctive normal form , 2005, J. Algorithms.

[13]  Edward A. Hirsch,et al.  New Worst-Case Upper Bounds for SAT , 2000, Journal of Automated Reasoning.

[14]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[15]  Osamu Watanabe,et al.  A Probabilistic 3-SAT Algorithm Further Improved , 2002, STACS.

[16]  Evgeny Dantsin,et al.  Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search , 2000, ICALP.

[17]  Daniel Rolf,et al.  3-SAT in RTIME(O(1.32793n)) - Improving Randomized Local Search by Initializing Strings of 3-Clauses , 2003, Electron. Colloquium Comput. Complex..