New algorithms for Exact Satisfiability

The Exact Satisfiability problem is to determine if a CNF-formula has a truth assignment satisfying exactly one literal in each clause; Exact 3-Satisfiability is the version in which each clause contains at most three literals. In this paper, we present algorithms for Exact Satisfiability and Exact 3-Satisfiability running in time O(20.2325n) and O(20.1379n), respectively. The previously best algorithms have running times O(20.2441n) for Exact Satisfiability (Methods Oper. Res. 43 (1981) 419-431) and O(20.1626n) for Exact 3-Satisfiability (Annals of Mathematics and Artificial Intelligence 43 (1) (2005) 173-193 and Zapiski nauchnyh seminarov POMI 293 (2002) 118-128). We extend the case analyses of these papers and observe that a formula not satisfying any of our cases has a small number of variables, for which we can try all possible truth assignments and for each such assignment solve the remaining part of the formula in polynomial time.

[1]  Kim G. Larsen,et al.  Regular languages definable by Lindström quantifiers , 2003, RAIRO Theor. Informatics Appl..

[2]  Ulrich Kohlenbach,et al.  Some logical metatheorems with applications in functional analysis , 2003 .

[3]  A. S. Kulikov.  An upper bound O(20.16254n) for exact 3-satisfiability: a simpler proof , 2005 .

[4]  Luca Aceto,et al.  Nested Semantics over Finite Trees are Equationally Hard: Invited Talk , 2003, EXPRESS.

[5]  David Peleg,et al.  Faster exact solutions for some NP-hard problems , 2002, Theor. Comput. Sci..

[6]  Margarita V. Korovina.  Recent Advances in Σ-definability over Continuous Data Types , 2003 .

[7]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[8]  Christian Kirkegaard,et al.  A Runtime System for XML Transformations in Java , 2003 .

[9]  Ivan Damgård,et al.  Scalable Key-Escrow , 2003 .

[10]  Stefan Porschen,et al.  Exact 3-satisfiability is decidable in time O(20.16254n) , 2005, Annals of Mathematics and Artificial Intelligence.

[11]  Adi Shamir,et al.  A T=O(2n/2), S=O(2n/4) Algorithm for Certain NP-Complete Problems , 1981, SIAM J. Comput..

[12]  Olivier Danvy,et al.  A functional correspondence between call-by-need evaluators and lazy abstract machines , 2003, Inf. Process. Lett..

[13]  Oliver Kullmann,et al.  Deciding propositional tautologies: Algorithms and their complexity , 1997 .

[14]  Stefan Porschen,et al.  Exact 3-Satisfiability Is Decidable in Time O (2 0.16254 n ) , 2005 .

[15]  Peter Jonsson,et al.  Algorithms for four variants of the exact satisfiability problem , 2004, Theor. Comput. Sci..