1 citations · 1 across the 1 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…
math.PR2007
A Systematic Scan for 7-colourings of the Grid
Markus Jalsenius, Kasper Pedersen
We study the mixing time of a systematic scan Markov chain for sampling from the uniform distribution on proper 7-colourings of a finite rectangular sub-grid of the infinite square…