Derandomizing HSSW Algorithm for 3-SAT
  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. 
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
cs.CC cs.DS