Using CSP To Improve Deterministic 3-SAT
Data Structures and Algorithms
2010-07-27 v2
Abstract
We show how one can use certain deterministic algorithms for higher-value constraint satisfaction problems (CSPs) to speed up deterministic local search for 3-SAT. This way, we improve the deterministic worst-case running time for 3-SAT to O(1.439^n).
Cite
@article{arxiv.1007.1166,
title = {Using CSP To Improve Deterministic 3-SAT},
author = {Konstantin Kutzkov and Dominik Scheder},
journal= {arXiv preprint arXiv:1007.1166},
year = {2010}
}
Comments
corrected typos, extended the introduction and added a notation section to make paper self-contained