论文信息 - Backtracking Based k-SAT Algorithms

Backtracking Based k-SAT Algorithms

RAMAMOHAN PATURI1, PAVEL PUDLÁK2, MICHAEL SAKS3, FRANCIS ZANE4 1 Department of Computer Science and Engineering, University of California at San Diego, San Diego, CA, USA 2 Mathematical Institute, Academy of Science of the Czech Republic, Prague, Czech Republic 3 Department of Mathematics, Rutgers, State University of New Jersey, Piscataway, NJ, USA 4 Bell Laboraties, Lucent Technologies, Murray Hill, NJ, USA

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

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

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

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

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

[6] 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..

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

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

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

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

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