Derandomizing the HSSW Algorithm for 3-SAT

[1]  Timon Hertli,et al.  3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[2]  Kazuo Iwama,et al.  Improved Randomized Algorithms for 3-SAT , 2010, ISAAC.

[3]  Timon Hertli,et al.  Improving PPSZ for 3-SAT using Critical Variables , 2010, STACS.

[4]  Dominik Scheder,et al.  A full derandomization of schöning's k-SAT algorithm , 2010, STOC.

[5]  Konstantin Kutzkov,et al.  Using CSP To Improve Deterministic 3-SAT , 2010, ArXiv.

[6]  Bernhard Haeupler,et al.  Deterministic algorithms for the Lovász Local Lemma , 2009, SODA '10.

[7]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[8]  Dominik Scheder,et al.  Guided Search and a Faster Deterministic Algorithm for 3-SAT , 2008, LATIN.

[9]  Daniel Rolf,et al.  Improved Bound for the PPSZ/Schöning-Algorithm for 3-SAT , 2006, J. Satisf. Boolean Model. Comput..

[10]  W. Kern,et al.  An improved deterministic local search algorithm for 3-SAT , 2004, Theor. Comput. Sci..

[11]  Manindra Agrawal,et al.  PRIMES is in P , 2004 .

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

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

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

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

[16]  U. Schöning.  A probabilistic algorithm for k-SAT and constraint satisfaction problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[17]  Sanjeev Mahajan,et al.  Derandomizing Approximation Algorithms Based on Semidefinite Programming , 1999, SIAM J. Comput..

[18]  Michael E. Saks,et al.  An improved exponential-time algorithm for k-SAT , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

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

[21]  Evgeny Dantsin,et al.  Worst-Case Upper Bounds , 2009, Handbook of Satisfiability.