An improved upper bound for SAT

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 400-407

  Dantsin, Evgeny ^a   Wolpert, Alexander ^a  

^a ROOSEVELT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; POLYNOMIALS;

BOOLEAN FORMULAS; SATISFIABILITY;

ALGORITHMS;

EID: 26444520430     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_31     Document Type: Conference Paper

References (12)

1. T. Brueggemann and W. Kern. An improved local search algorithm for 3-SAT. Theoretical Computer Science, 329(1-3):303-313, December 2004.
2. n algorithm for k-SAT based on local search. Theoretical Computer Science, 289(1):69-83, 2002.
3. E. Dantsin, E. A. Hirsch, and A. Wolpert. Algorithms for SAT based on search in Hamming balls. In Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STAGS 2004, volume 2996 of Lecture Notes in Computer Science, pages 141-151. Springer, March 2004.
4. E. Dantsin and A. Wolpert. Derandomization of Schuler's algorithm for SAT. In Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing, SAT 2004, pages 69-75, May 2004.
5. E. Dantsin and A. Wolpert. An improved upper bound for SAT. Electronic Colloquium on Computational Complexity, Report TR05-030, March 2005.
6. K. Iwama and S. Tamaki. Improved upper bounds for 3-SAT. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, page 328, January 2004. A preliminary version appeared in Electronic Colloquium on Computational Complexity, Report No. 53, July 2003.
7. R. Paturi, P. Pudlák, M. E. Saks, and F. Zane. An improved exponential-time algorithm for k-SAT. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98, pages 628-637, 1998.
8. R. Paturi, P. Pudlák, and F. Zane. Satisfiability coding lemma. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97, pages 566-574, 1997.
9. P. Pudlák. Satisfiability - algorithms and logic. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98), volume 1450 of Lecture Notes in Computer Science, pages 129-141. Springer-Verlag, 1998.
10. U. Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, FOCS'99, pages 410-414, 1999.
11. U. Schöning. A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica, 32(4):615-623, 2002.
12. R. Schuler. An algorithm for the satisfiability problem of formulas in conjunctive normal form. Journal of Algorithms, 54(1):40-44, January 2005. A preliminary version appeared as a technical report in 2003.