New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms
An improved deterministic local search algorithm for 3-SAT
Theoretical Computer Science
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Solving Satisfiability with Less Searching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Derandomization of schuler’s algorithm for SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
An Improved SAT Algorithm in Terms of Formula Length
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
An algorithm for the SAT problem for formulae of linear length
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
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.