13 citations · 13 across the 1 of their papers we have counts for
2 papers
cs.CC2018
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg +2
We analyse the complexity of approximate counting constraint satisfactions problems , where is a set of nonnegative rational-valued funct…
cs.CC2013★ 13 cited
Approximating Holant problems by winding
Colin McQuillan
We give an FPRAS for Holant problems with parity constraints and not-all-equal constraints, a generalisation of the problem of counting sink-free-orientations. The approach combine…