Complexity of generalized satisfiability counting problems. (English) Zbl 0853.68110

Summary: The class of generalized satisfiability problems, introduced in 1978 by Schaefer, presents a uniform way of studying the complexity of satisfiability problems with special conditions. The complexity of each decision and counting problem in this class depends on the involved logical relations. In 1979, Valiant defined the class # P, the class of functions definable as the number of accepting computations of a polynomial-time nondeterministic Turing machine. Clearly, all satisfiability counting problems belong to this class # P. We prove a dichotomy theorem for generalized satisfiability counting problems.
That is, if all logical relations involved in a generalized satisfiability counting problem are affine then the number of satisfying assignments of this problem can be computed in polynomial time, otherwise this function is # P-complete. This gives us a comparison between decision and counting generalized satisfiability problems. We can determine exactly the polynomial satisfiability decision problems whose number of solutions can be computed in polynomial time and also the polynomial satisfiability decision problems whose counting counterparts are already # P-complete. Moreover, taking advantage of a similar dichotomy result proved in 1978 by Schaefer for generalized satisfiability decision problems, we get as a corollary the implication that the counting counterpart of each NP-complete generalized satisfiability decision problem is # P-complete.


68Q25 Analysis of algorithms and problem complexity
Full Text: DOI Link