A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
نویسندگان
چکیده
منابع مشابه
A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs
We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number of additional unary (i.e., arity 1) constraints, particularly, when degrees of input instances are bounded from above by a fixed constant. All degree-1 counting CSPs are obviously solvable in poly...
متن کاملApproximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
Constraint satisfaction problems (or CSPs) have been extensively studied in, for instance, artificial intelligence, database theory, graph theory, and statistical physics. From a practical viewpoint, it is beneficial to approximately solve CSPs. When one tries to approximate the total number of truth assignments that satisfy all Boolean constraints for (unweighted) Boolean CSPs, there is a know...
متن کاملDegree two approximate Boolean #CSPs with variable weights
A counting constraint satisfaction problem (#CSP) asks for the number of ways to satisfy a given list of constraints, drawn from a fixed constraint language Γ. We study how hard it is to evaluate this number approximately. There is an interesting partial classification, due to Dyer, Goldberg, Jalsenius and Richerby [DGJR10], of Boolean constraint languages when the degree of instances is bounde...
متن کاملA dichotomy theorem for conservative general-valued CSPs
We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a constraint language, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimise the sum. We consider the case of so-called conservative languages; that is, languages containi...
متن کاملDescriptive complexity of approximate counting CSPs
Motivated by Fagin’s characterization of NP, Saluja et al. have introduced a logic based framework for expressing counting problems. In this setting, a counting problem (seen as a mapping C from structures to non-negative integers) is ’defined’ by a first-order sentence φ if for every instance A of the problem, the number of possible satisfying assignments of the variables of φ in A is equal to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.03.036