Unique k-SAT and General k-SAT

[1]  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).

[2]  Daniel Rolf,et al.  Derandomization of PPSZ for Unique- k-SAT , 2005, SAT.

[3]  Russell Impagliazzo,et al.  The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs , 2008, J. Comput. Syst. Sci..

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

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

[6]  Kazuhisa Makino,et al.  Derandomizing the HSSW Algorithm for 3-SAT , 2011, Algorithmica.

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

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