On the complexity of #CSP

@inproceedings{Dyer2010OnTC,
  title={On the complexity of #CSP},
  author={Martin E. Dyer and David Richerby},
  booktitle={STOC},
  year={2010}
}
Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem, #CSP. A problem from #CSP is characterized by a constraint language γ, which is a fixed, finite set of relations over a finite domain. An instance of the problem uses these relations to constrain the values taken by a finite set of variables. Bulatov showed that, for any fixed γ, the problem of counting the satisfying assignments of instances of any problem from #CSP is either in polynomial time (FP) or #P… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 26 CITATIONS

References

Publications referenced by this paper.