A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
3-coloring in time 0(1.3446^n): a no-MIS algorithm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Solving satisfiability in less than 2n steps
Discrete Applied Mathematics
A full derandomization of schöning's k-SAT algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
Derandomizing HSSW algorithm for 3-SAT
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
Most deterministic algorithms for NP-hard problems are splitting algorithms: They split a problem instance into several smaller ones, which they solve recursively. Often, the algorithm has a choice between several splittings. For 3-SAT, we show that choosing wisely which splitting to apply, one can avoid encountering too many worst-case instances. This improves the currently best known deterministic worst case running time for 3-SAT from O(1.473n) to O(1.465n), n being the number of variables in the input formula.