Derandomizing the HSSW Algorithm for 3-SAT
We present a (full) derandomization of HSSW algorithm for 3-SAT, proposed by Hofmeister, Schning, Schuler, and Watanabe (in STACS 2002, pp.192202, 2002). Thereby, we obtain an O(1.3303 n )-time deterministic algorithm for 3-SAT, which is currently fastest.
derandomization 3-sat deterministic algorithm