Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable

We present an algorithm that decides the satisfiability of a formula F on CNF form in time O(1.1279(d−2)n), if F has at most d occurrences per variable or if F has an average of d occurrences per variable and no variable occurs only once. For d ≤ 4, this is better than previous results. This is the first published algorithm that is explicitly constructed to be efficient for cases with a low number of occurrences per variable. Previous algorithms that are applicable to this case exist, but as these are designed for other (more general, or simply different) cases, their performance guarantees for this case are weaker.

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

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

[3]  Stefan Szeider,et al.  Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable , 2003, COCOON.

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

[5]  Magnus Wahlström,et al.  Counting models for 2SAT and 3SAT formulae , 2005, Theor. Comput. Sci..

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

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

[8]  Craig A. Tovey,et al.  A simplified NP-complete satisfiability problem , 1984, Discret. Appl. Math..

[9]  Evgeny Dantsin,et al.  Derandomization of Schuler's Algorithm for SAT , 2004, SAT.

[10]  Paul W. Purdom,et al.  Solving Satisfiability with Less Searching , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[13]  Walter Kern,et al.  An improved deterministic local search algorithm for 3-SAT , 2004, Theor. Comput. Sci..

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

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

[16]  Ge Xia,et al.  Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems , 2003, ISAAC.