The complexity of weighted and unweighted #CSP

Details The complexity of weighted and unweighted #CSP The complexity of weighted and unweighted #CSP

2010-05-15

arxiv.org/abs/1005.2678v2

JCSS 2012

Computer Science

Computational Complexity

11 pages

Scientific paper

10.1016/j.jcss.2011.12.002

We give some reductions among problems in (nonnegative) weighted #CSP which
restrict the class of functions that needs to be considered in computational
complexity studies. Our reductions can be applied to both exact and approximate
computation. In particular, we show that a recent dichotomy for unweighted #CSP
can be extended to rational-weighted #CSP.

Affiliated with

Also associated with

No associations

Rating

The complexity of weighted and unweighted #CSP 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 The complexity of weighted and unweighted #CSP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of weighted and unweighted #CSP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-240946