A Full Derandomization of Schoening's k-SAT Algorithm
Data Structures and Algorithms
2010-08-25 v1 Discrete Mathematics
Abstract
Schoening in 1999 presented a simple randomized algorithm for k-SAT with running time O(a^n * 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.
Cite
@article{arxiv.1008.4067,
title = {A Full Derandomization of Schoening's k-SAT Algorithm},
author = {Robin A. Moser and Dominik Scheder},
journal= {arXiv preprint arXiv:1008.4067},
year = {2010}
}
Comments
11 pages