A probabilistic 3–SAT algorithm further improved

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

Volumn 2285, Issue , 2002, Pages 192-202

  Hofmeister, Thomas ^a   Schöning, Uwe ^b   Schuler, Rainer ^b   Watanabe, Osamu ^c  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF ULM   (Germany)

^c TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EXPECTED RUNNING TIME; EXPECTED TIME; RANDOMIZED ALGORITHMS; RUNNING TIME; SAT PROBLEMS; TIME BOUND;

ARTIFICIAL INTELLIGENCE;

EID: 84937417239     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_15     Document Type: Conference Paper

References (7)

1. B. Aspvall, M.F. Plass, R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters, 8(3), 121–123, 1979.
2. E. Dantsin, A. Goerdt, E.A. Hirsch, and U. Schöning, Deterministic algorithms for k-SAT based on covering codes and local search, in Proc. 27th International Colloquium on Automata, Languages and Programming, ICALP’00, Lecture Notes in Comp. Sci. 1853, 236–247, 2000.
3. E.A. Hirsch, New worst-case upper bounds for SAT, Journal of Automated Reasoning, 24(4), 397–420, 2000.
4. O. Kullmann, New methods for 3-SAT decision and worst-case analysis, Theoretical Computer Science, 223(1/2), 1–72, 1999.
5. B. Monien and E. Speckenmeyer, Solving satisfiability in less than 2n steps, Discrete Applied Mathematics, 10, 287–295, 1985.
6. R. Paturi, P. Pudlák, M.E. Saks, and F. Zane, An improved exponential-time algorithm for k-SAT, in Proc. of the 39th Ann. IEEE Sympos. on Foundations of Comp. Sci. (FOCS’98), IEEE, 628–637, 1998.
7. U. Schöning, A probabilistic algorithm for k-SAT and constraint satisfaction problems, in Proc. of the 40th Ann. IEEE Sympos. on Foundations of Comp. Sci. (FOCS’99), IEEE, 410–414, 1999.