论文信息 - An improved deterministic local search algorithm for 3-SAT

An improved deterministic local search algorithm for 3-SAT

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.

Walter Kern | Tobias Brüggemann

[1] Kazuo Iwama,et al. Improved upper bounds for 3-SAT , 2004, SODA '04.

[2] Osamu Watanabe,et al. A Probabilistic 3-SAT Algorithm Further Improved , 2002, STACS.

[3] Uwe Schöning,et al. A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart , 2002, Algorithmica.

[4] Jon M. Kleinberg,et al. A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search , 2002, Theor. Comput. Sci..