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.
Unable to display preview. Download preview PDF.
- 8.Eppstein, D.: Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms (SODA 2001), pp. 329–337 (2001)Google Scholar
- 11.Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), p. 328 (2004)Google Scholar