The complexity of weighted and unweighted #CSP
Computational Complexity
2015-03-17 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1005.2678,
title = {The complexity of weighted and unweighted #CSP},
author = {Andrei Bulatov and Martin Dyer and Leslie Ann Goldberg and Markus Jalsenius and Mark Jerrum and David Richerby},
journal= {arXiv preprint arXiv:1005.2678},
year = {2015}
}
Comments
11 pages