An improved exponential-time algorithm for k-SAT

Journal of the ACM

Volumn 52, Issue 3, 2005, Pages 337-364

  Paturi, Ramamohan ^a,e   Pudlák, Pavel ^b   Saks, Michael E ^c   Zane, Francis ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

^c RUTGERS UNIVERSITY   (United States)

^d LUCENT TECHNOLOGIES   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

CNF satisfiability; Randomized algorithms

Indexed keywords

CNF SATISFIABILITY; RANDOMIZED ALGORITHMS;

BOOLEAN FUNCTIONS; PROBABILITY;

ALGORITHMS;

EID: 30544433705     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1066100.1066101     Document Type: Article

References (23)

1. ALON, N., SPENCER, J., AND ERDÖS, P. 1992. The Probabilistic Method. Wiley, New York.
2. n algorithm for k-SAT based on local search. Theoret. Comput. sci. 289, 69-83.
3. DAVIV, M., LOGEMANN, G., AND LOVELAND, D. 1962. A machine program for theorem proving, Commun. ACM 5, 394-397.
4. GALIL, Z. 1975. On the validity and complexity of bounded resolution. In Proceedings of the 7th ACM Symposium on Theory of Computing. ACM, New York, 72-82.
5. HARRIS, T. E. 1960. A lower bound for the critical probability in a certain percolation process. Proc. Camb. Phil. Soc. 56, 13-20.
6. HÅSTAD, J. 1986. Almost optimal lower bounds for small depth circuits. In Proceedings of the 18th ACM Symposium on Theory of Computing. ACM, New York, 6-20.
7. HÅSTAD, J., JUKNA, S., AND PUDLÁK, P. 1993. Top-down lower bounds for depth 3 circuits. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 124-129.
8. HIRSCH, E. 2000. New worst-case upper bounds for SAT. J. Automat. Reas. 24, 4, 397-420.
9. HIRSCH, E., AND KOJEVNIKOV, A. 2002. Unit Walk: A new SAT solver that uses local search guided by unit clause elimination. In Proceedings of 5th International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002). 35-42
10. HOFMEISTER, T., SCHÖNING, U., SCHULER, R., AND WATANABE, O. 2002. A probabilistic 3-SAT algorithm further improved. In STACS 2002. Lecture Notes in Computer Science, vol. 2285. Springer-Verlag, New York, 192-202.
11. KULLMANN, O. 1999. New methods for 3-SAT decision and worst-case analysis. Theoret. Comput. sci. 223, 1-2 (July), 1-72.
12. KULLMANN, O., AND LUCKHARDT, H. 1998. Algorithms for SAT/TAUT decision based on various measures. Preprint, 81 pages http://www.cs.utoronto.ca/kullmann/.
13. MACWILLIAMS, F. J., AND SLOANE, N. J. 1977. The Theory of Error-Correcting Codes. North-Holland, Amsterdam The Netherland.
14. n steps. Discr. Appl. Math. 10, 287-295.
15. PATURI, R., PUDLÁK, P., SAKS, M., AND ZANE, F. 1998. An improved exponential-time algorithm for k-SAT. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 628-637.
16. PATURI, R., PUDLÁK, P., AND ZANE, F. 1997. Satisfiability coding lemma. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 566-574.
17. (See also Chicago J. Theor. Comput. sci. (Dec. 1999), http://cjtcs.cs.uchicago.edu/.)
18. RAZBOROV, A. A. 1986. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Matematicheskie Zametki 41, 598-607 (in Russian).
19. (English Translation in Mathematical Notes of the Academy of Sciences of the USSR 41, 333-338.)
20. n steps. In Selected papers from CSL 92. Lecture Notes in Computer Science, vol. 702. Springer-Verlag, New York, 379-394.
21. SCHÖNING, U. 1999. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 410-414.
22. VALIANT, L. G. 1977. Graph-theoretic arguments in low-level complexity. In Proceedings of the 6th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 53, Springer-Verlag, New York, 162-176.
23. ZHANG, W. 1996. Number of models and satisfiability of sets of clauses. Theoret. Comput. sci. 155, 277-288.