2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2008
The Complexity of Weighted Boolean #CSP with Mixed Signs
Andrei Bulatov, Martin Dyer, Leslie Ann Goldberg +2
We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set o…
cs.CC2007★ 2 cited
An approximation trichotomy for Boolean #CSP
Martin Dyer, Leslie Ann Goldberg, Mark Jerrum
We give a trichotomy theorem for the complexity of approximately counting the number of satisfying assignments of a Boolean CSP instance. Such problems are parameterised by a const…