An algorithm for the SAT problem for formulae of linear length

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 107-118

  Wahlström, Magnus ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; BOUNDARY VALUE PROBLEMS; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

EXACT ALGORITHMS; SAT PROBLEM;

ALGORITHMS;

EID: 27144480315     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_12     Document Type: Conference Paper

References (14)

1. Tobias Brueggemann and Walter Kern. An improved deterministic local search algorithm for 3-SAT. Theoretical Computer Science, 329(1-3):303-313, 2004.
2. Vilhelm Dahllöf, Peter Jonsson, and Magnus Wahlström. Counting models for 2SAT and 3SAT formulae. Theoretical Computer Science, 332(1-3):265-291, 2005.
3. n algorithm for k-SAT based on local search. Theoretical Computer Science, 289(1):69-83, 2002.
4. Evgeny Dantsin, Edward A. Hirsch, and Alexander 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, 2004.
5. Evgeny Dantsin and Alexander 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, 2004.
6. Evgeny Dantsin and Alexander Wolpert. An improved upper bound for SAT. Technical Report TR05-030, Electronic Colloquium on Computational Complexity, 2005.
7. Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, 1960.
8. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
9. Edward A. Hirsch. New worst-case upper bounds for SAT. Journal of Automated Reasoning, 24(4):397-420, 2000.
10. Kazuo Iwama and Suguru Tamaki. Improved upper bounds for 3-SAT. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), page 328, 2004.
11. Oliver Kullmann. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, 223:1-72, 1999.
12. Uwe Schöning. A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica, 32(4):615-623, 2002.
13. Rainer Schuler. An algorithm for the satisfiability problem of formulas in conjunctive normal form. Journal of Algorithms, 54(1):40-44, 2005.
14. Magnus Wahlström. Faster exact solving of SAT formulae with a low number of occurrences per variable. In Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT-2005), 2005.