Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2919, Issue , 2004, Pages 150-161

  Baumer, Sven ^a   Schuler, Rainer ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC;

3-SAT PROBLEMS; BOOLEAN FORMULAE; DYNAMIC SEARCH; EXPECTED TIME; EXPONENTIAL TIME; PROBABILISTIC ALGORITHM; RANDOM WALK ALGORITHMS; SATISFIABILITY PROBLEMS;

ALGORITHMS;

EID: 33645614648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_12     Document Type: Article

References (10)

1. B. Aspvall, M.F. Plass, and R.E. Tarjan. A linear-time algorithm for testing the truth of certain quantified boolean formulas. IPL, 8(3):121-123, 1979.
2. S. Aida, R. Schuler, T. Tatsukiji, and O. Watanabe. The difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. Theory of Computing Systems, 35:449-463, 2002.
3. n algorithm for k-SAT based on local search. Theoretical Computer Science, 289:69-83, 2002.
4. T. Hofmeister, U. Schöning, R. Schuler, and O. Watanabe. A probabilistic 3-SAT algorithm further improved. In Proceedings 19th Symposium on Theoretical Aspects of Computer Science, volume 2285 of LNCS, pages 192-203. Springer-Verlag, 2002.
5. O. Kullmann. New methods for 3-sat decision and worst-case analysis. Theoretical Computer Science, 223:1-72, 1999.
6. n steps. Discrete Applied Mathematics, 10:287-295, 1985.
7. R. Paturi, P. Pudlák and F. Zane. Satisfiability coding lemma. In 38th Ann. IEEE Sympos. on Foundations of Comp. Sci. (FOCS'97), pages 566-574, 1997.
8. R. Paturi, P. Pudlák, M.E. Saks, and F. Zane. An improved exponential-time algorithm for k-sat. In 39th Ann. IEEE Sympos. on Foundations of Comp. Sci. (FOCS'98), pages 410-414, 1998.
9. n) steps. In Computer Science Logic (CSL), volume 702 of LNCS, pages 379-394. Springer, 1992.
10. Uwe Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proc. 40th FOCS, pages 410-414. ACM, 1999.