An improved Õ(1.234 m)-time deterministic algorithm for SAT

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

Volumn 3827 LNCS, Issue , 2005, Pages 644-653

  Yamamoto, Masaki ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CNF SATISFIABILITY PROBLEM; DETERMINISTIC ALGORITHMS; HIRSCH'S ALGORITHM; SAT;

NUMBER THEORY; PROBLEM SOLVING;

ALGORITHMS;

EID: 33744962056     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_65     Document Type: Conference Paper

References (9)

1. Dantsin E., Hirsch E. A., and Wolpert A., "Algorithms for SAT baaed on search in Hamming balls", Proc. of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS04), 141-151, 2004.
2. Dantsin E. and Wolpert A., "Derandomization of Schuler's algorithms for SAT", Proc. of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT04), 69-75, 2004.
3. Davis M., Logemann G., and Loveland D., "'A machine program for theorem-proving", Comm. ACM(5), 394-397, 1962.
4. Davis M., and Putnam H., "A computing procedure for quantification theory", J. of ACM(7), 201-215, 1960.
5. Hirsch E. A., "New Worst-Case Upper Bounds for SAT", J. of Automated Reasoning, 24, 397-420, 2000.
6. (It is also in Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA98), 521-530, 1998.)
7. n steps", Discrete Appl. Math.(10), 287-295, 1985.
8. Pudlák P., "Satisfiability - algorithm and logic", Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science (MPCS98), 129-141, 1998.
9. Schuler R., "An algorithm for the satisfiability problem of formulas in conjunctive normal form", J. of Algorithms, 54 40-44, 2005.