A Full Derandomization of Schoening's k-SAT Algorithm
Moser, Robin A. · Scheder, Dominik
Original · EN
Schoening in 1999 presented a simple randomized algorithm for k-SAT with running time O(aⁿ * poly(n)) for a = 2(k-1)/k. We give a deterministic version of this algorithm running in time O((a+epsilon)ⁿ * poly(n)), where epsilon > 0 can be made arbitrarily small.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.