24 citations · 60 across the 8 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.CC2012★ 4 cited
Approximating the partition function of planar two-state spin systems
Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan
We consider the problem of approximating the partition function of the hard-core model on planar graphs of degree at most 4. We show that when the activity lambda is sufficiently l…
cs.CC2012★ 14 cited
The complexity of approximating conservative counting CSPs
Xi Chen, Martin Dyer, Leslie Ann Goldberg +4
We study the complexity of approximately solving the weighted counting constraint satisfaction problem #CSP(F). In the conservative case, where F contains all unary functions, ther…
cs.CC2012
Degree two approximate Boolean #CSPs with variable weights
Colin McQuillan
A counting constraint satisfaction problem (#CSP) asks for the number of ways to satisfy a given list of constraints, drawn from a fixed constraint language Γ. We study how hard it…