A Full Derandomization of Schoening's k-SAT Algorithm
Abstract
Schoening in 1999 presented a simple randomized algorithm for k-SAT with running time O(an * poly(n)) for a = 2(k-1)/k. We give a deterministic version of this algorithm running in time O((a+epsilon)n * poly(n)), where epsilon > 0 can be made arbitrarily small.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.