A full derandomization of schöning's k-SAT algorithm

Schoening in 1999 presented a simple randomized algorithm for k-SAT with running time a<sup>n</sup> * poly(n) for a = 2(k-1)/k. We give a deterministic version of this algorithm running in time a<sup>n+o(n)</sup>.

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

[2]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

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

[4]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[5]  C.H. Papadimitriou,et al.  On selecting a satisfying truth assignment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[7]  Ryan Williams,et al.  Improving exhaustive search implies superpolynomial lower bounds , 2010, STOC '10.

[8]  Pavel Pudlák,et al.  On the complexity of circuit satisfiability , 2010, STOC '10.

[9]  Uwe Schöning.  A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems , 1999, FOCS.

[10]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

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

[12]  Konstantin Kutzkov,et al.  Using Constraint Satisfaction To Improve Deterministic 3-SAT , 2010 .

[13]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

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

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