Exact 3-satisfiability is decidable in time O(20.16254n)

Annals of Mathematics and Artificial Intelligence

Volumn 43, Issue 1-4, 2005, Pages 173-193

  Porschen, Stefan ^a   Randerath, Bert ^a   Speckenmeyer, Ewald ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

autonomous clause pattern; exact satisfiability; formula graph; NP completeness; perfect matching

Indexed keywords

EID: 10344238111     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-005-0428-2     Document Type: Article

References (6)

1. V. Dahllöf and P. Jonson, Exact 3-Satisfiability - the decision and counting problems, Working Paper, Department of Computer and Information Science, Linköping University, Sweden (2002).
2. L. Drori and D. Peleg, Faster solutions for Exact Hitting and Exact SAT, Technical report MCS99-15, Weizmann Institute of Science, Israel (1999).
3. L. Drori and D. Peleg, Faster exact solutions for some NP-hard problems, in: Proceedings of the European Symposium on Algorithms (ESA 1999), Prague, Czech Republic, ed. J. Nesetril, Lecture Notes in Computer Science, Vol. 1643 (Springer, 1999) pp. 450-461.
4. L. Lovász and M. D. Plummer, Matching Theory, Annals of Discrete Mathematics, Vol. 29 (North-Holland, 1986).
5. B. Monien, E. Speckenmeyer and O. Vornberger, Upper bounds for covering problems, Methods of Operations Research 43 (1981) 419-431.
6. T.J. Schaefer, The complexity of satisfiability problems, in: Conference Record of the Tenth Annual ACM Symposium on Theory of Computing, San Diego, CA, 1-3 May 1978 (ACM, 1978) pp. 216-226.