Abstract
In [Sch99], Schoning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly(n) • (4/3)n = O(1.3334n) when given a formula F on n variables. This was the up to now best running time known for an algorithm solving 3-SAT. Here, we describe an algorithm which improves upon this time bound by combining an improved version of the above randomized algorithm with other randomized algorithms. Our new expected time bound for 3-SAT is O(1.3302n).
Cite
CITATION STYLE
Hofmeister, T., Schöning, U., Schuler, R., & Watanabe, O. (2002). A probabilistic 3–SAT algorithm further improved. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2285, pp. 192–202). Springer Verlag. https://doi.org/10.1007/3-540-45841-7_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
