The Complexity of Weighted Boolean #CSP Modulo k
نویسندگان
چکیده
We prove a complexity dichotomy theorem for counting weighted Boolean CSP modulo k for any positive integer k > 1. This generalizes a theorem by Faben for the unweighted setting. In the weighted setting, there are new interesting tractable problems. We first prove a dichotomy theorem for the finite field case where k is a prime. It turns out that the dichotomy theorem for the finite field is very similar to the one for the complex weighted Boolean #CSP, found by [Cai, Lu and Xia, STOC 2009]. Then we further extend the result to an arbitrary integer k. 1998 ACM Subject Classification F.2 [Theory of Computation] Analysis of Algorithms and Problem Complexity
منابع مشابه
The Approximability of Three-valued MAX CSP
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied constraints. This problem is NP-hard in general, and, therefore, it is natural t...
متن کاملThe complexity of approximating conservative counting CSPs
We study the complexity of approximation for a weighted counting constraint satisfaction problem #CSP(F). In the conservative case, where F contains all unary functions, a classification is known for the Boolean domain. We give a classification for problems with general finite domain. We define weak log-modularity and weak log-supermodularity, and show that #CSP(F) is in FP if F is weakly log-m...
متن کاملThe complexity of complex weighted Boolean #CSP
We prove a complexity dichotomy theorem for the most general form of Boolean #CSP where every constraint function takes values in the complex number field C. This generalizes a theorem by Dyer, Goldberg and Jerrum [11] where each constraint function takes non-negative values. We first give a non-trivial tractable class of Boolean #CSP which was inspired by holographic reductions. The tractabili...
متن کاملThe Complexity of Weighted Boolean #CSP
This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterised by a finite set F of non-negative functions that may be used to assign weights to the configurations (feasible solutions) of a problem instance. Classical constraint satisfaction problems correspond to the ...
متن کاملModulo Information from Nonadaptive Queries to NP
The classes of languages accepted by nondeterministic polynomial-time Turing machines (NP machines, in short) that have restricted access to an NP oracle|the machines can ask k queries to the NP oracle and the answer they receive is the number of queries in the oracle language modulo a number m 2|are considered. It was shown in HT95] that these classes coincide with an appropriate level of the ...
متن کامل