We slightly improve the pruning technique presented in Dantsin et al. (Theoret. Comput. Sci. 289 (2002) 69) to obtain an O*(1.473n) deterministic algorithm for 3-SAT.
['Tobias Brueggemann', 'Walter Kern']
An improved deterministic local search algorithm for 3-SAT