@inproceedings{e7efd4f40c9a46e597ffd0f89c07345e,
title = "Deterministic algorithms for k-SAT based on covering codes and local search",
abstract = "We show that satisfiability of formulas in k-CNF can be decided deterministically in time close to (2k/(k + 1))n, where n is the number of variables in the input formula. This is the best known worst-case upper bound for deterministic k-SAT algorithms. Our algorithm can be viewed as a derandomized version of Sch{\"o}ning{\textquoteright}s probabilistic algorithm presented in [15]. The key point of our algorithm is the use of covering codes together with local search. Compared to other “weakly exponential” algorithms, our algorithm is technically quite simple. We also show how to improve the bound above by moderate technical effort. For 3-SAT the improved bound is 1.481n.",
author = "Evgeny Dantsin and Andreas Goerdt and Hirsch, {Edward A.} and Uwe Sch{\"o}ning",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 27th International Colloquium on Automata, Languages and Programming, ICALP 2000 ; Conference date: 09-07-2000 Through 15-07-2000",
year = "2000",
doi = "10.1007/3-540-45022-x_21",
language = "אנגלית",
isbn = "9783540450221",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "236--247",
editor = "Ugo Montanari and Rolim, {Jose D. P.} and Emo Welzl",
booktitle = "Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings",
}