Degree two approximate Boolean #CSPs with variable weights

Details Degree two approximate Boolean #CSPs with variable weights Degree two approximate Boolean #CSPs with variable weights

2012-04-25

arxiv.org/abs/1204.5714v1

Computer Science

Computational Complexity

Scientific paper

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 \Gamma. We study how hard it is to evaluate this number approximately. There is an interesting partial classification, due to Dyer, Goldberg, Jalsenius and Richerby, of Boolean constraint languages when the degree of instances is bounded by d>=3 - every variable appears in at most d constraints - under the assumption that "pinning" is allowed as part of the instance. We study the d=2 case under the stronger assumption that "variable weights" are allowed as part of the instance. We give a dichotomy: in each case, either the #CSP is tractable, or one of two important open problems, #BIS or #PM, reduces to the #CSP.

Affiliated with

Also associated with

No associations

Rating

Degree two approximate Boolean #CSPs with variable weights does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Degree two approximate Boolean #CSPs with variable weights, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Degree two approximate Boolean #CSPs with variable weights will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-140653