A randomized, efficient algorithm for 3SAT

In this paper I present a 3SAT algorithm based on the randomized algorithm of Papadimitriou from 1991, and Schoning from 1991. We also show that this algorithm finds a solution (if it exists) for a 3SAT problem with high probability in polynomial time.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

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

[3]  Lance Fortnow,et al.  The Golden Ticket - P, NP, and the Search for the Impossible , 2013, Bull. EATCS.

[4]  R. Durrett.  Probability: Theory and Examples , 1993 .

[5]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[6]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[7]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.