Derandomization of Schuler's algorithm for SAT

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 80-88

  Dantsin, Evgeny ^a   Wolpert, Alexander ^a  

^a ROOSEVELT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES;

RANDOMIZED ALGORITHM; SATISFIABILITY TESTING;

ALGORITHMS;

EID: 26444576846     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527695_7     Document Type: Conference Paper

References (17)

1. S. Baumer and R. Schuler. Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs. Electronic Colloquium on Computational Complexity, Report No. 10, February 2003.
2. n algorithm for k-SAT based on local search. Theoretical Computer Science, 289(1):69-83, October 2002.
3. E. Dantsin, A. Goerdt, E. A. Hirsch, and U. Scheming. Deterministic algorithms for k-SAT based on covering codes and local search. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, volume 1853 of Lecture Notes in Computer Science, pages 236-247. Springer, July 2000.
4. 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, STACS 2004, volume 2996 of Lecture Notes in Computer Science, pages 141-151. Springer, March 2004.
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394-397, 1962.
6. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
7. E. A. Hirsch. New worst-case upper bounds for SAT. Journal of Automated Reasoning, 24(4):397-420, 2000.
8. T. Hofmeister, U. Schöning, R. Schuler, and O. Watanabe. A probabilistic 3-SAT algorithm further improved. In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Scienceg, STACS 2002, volume 2285 of Lecture Notes in Computer Science, pages 192-202. Springer, March 2002.
9. K. Iwama and S. Tamaki. Improved upper bounds for 3-SAT. Electronic Colloquium on Computational Complexity, Report No. 53, July 2003.
10. O. Kullmann. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, 223(1-2):1-72, 1999.
11. 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.
12. 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.
13. 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, 1998.
14. n)) - improving randomized local search by initializing strings of 3-clauses. Electronic Colloquium on Computational Complexity, Report No. 54, July 2003.
15. 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.
16. U. Schöning. A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmic, 32(4):615-623, 2002.
17. R. Schuler. An algorithm for the satisfiability problem of formulas in conjunctive normal form. To appear in Journal of Algorithms, 2003.