Randomized Algorithms for 3-SAT

In [Sch99], Sch¨oning 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

• Type: Journal
• Year: 2007
• Where: MST
• Authors: Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
• Keywords: Expected Running Time, Efficient Randomized Algorithm, K-SAT Problem, MST 2007