论文信息 - Backtracking Based k-SAT Algorithms - 字舞流文

Backtracking Based k-SAT Algorithms

Michael E. Saks | Pavel Pudlák | Ramamohan Paturi | Francis Zane | M. Saks | P. Pudlák | R. Paturi | F. Zane

[1] Michael E. Saks,et al. An improved exponential-time algorithm for k-SAT , 2005, JACM.

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

[3] Russell Impagliazzo,et al. The complexity of unique k-SAT: an isolation lemma for k-CNFs , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[4] Rainer Schuler,et al. Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs , 2003, SAT.

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

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

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

[8] Oliver Kullmann,et al. New Methods for 3-SAT Decision and Worst-case Analysis , 1999, Theor. Comput. Sci..

[9] Pavel Pudlák,et al. Satisfiability Coding Lemma , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[10] Ewald Speckenmeyer,et al. Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..

[11] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.