An improved deterministic local search algorithm for 3-SAT

Theoretical Computer Science

Volumn 329, Issue 1-3, 2004, Pages 303-313

  Brueggemann, Tobias ^a   Kern, Walter ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

3 SAT; Exact algorithm; Local search

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER SCIENCE; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

3-SAT; EXACT ALGORITHM; LOCAL SEARCH;

ALGORITHMS;

EID: 10044219900     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.08.002     Document Type: Article

References (4)

1. n algorithm for fc-SAT based on local search, Theoret. Comput. Sci. 289 (2002) 69-83.
2. T. Hofmeister, U. Schöning, R. Schuler, O. Watanabe, A Probabilistic 3-SAT Algorithm Further Improved, in: H. Alt, A. Ferreira (Eds.), STACS 2002, Lecture Notes in Computer Science, Vol. 2285, Springer, Berlin, Heidelberg, 2002, pp. 192-202.
3. K. Iwama, S. Tamaki, Improved Upper Bounds for 3-SAT, in: Lecture Notes Series of ECCC, Electronic Colloquium on Computational Complexity, Vol. 53, University of Trier, 2003.
4. U. Schöning, A probabilistic algorithm for k-SAT based on limited local search and restart, Algorithmica 32 (2002) 615-623.