Derandomizing HSSW Algorithm for 3-SAT
Computational Complexity
2011-02-21 v1 Data Structures and Algorithms
Abstract
We present a (full) derandomization of HSSW algorithm for 3-SAT, proposed by Hofmeister, Sch\"oning, Schuler, and Watanabe in [STACS'02]. Thereby, we obtain an O(1.3303^n)-time deterministic algorithm for 3-SAT, which is currently fastest.
Cite
@article{arxiv.1102.3766,
title = {Derandomizing HSSW Algorithm for 3-SAT},
author = {Kazuhisa Makino and Suguru Tamaki and Masaki Yamamoto},
journal= {arXiv preprint arXiv:1102.3766},
year = {2011}
}
Comments
11 pages