95 citations · 675 across the 48 of their papers we have counts for
4 papers · 1 filter
A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid
Leslie Ann Goldberg, Mark Jerrum
We investigate the computational difficulty of approximating the partition function of the ferromagnetic Ising model on a regular matroid. Jerrum and Sinclair have shown that there…
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials
Leslie Ann Goldberg, Mark Jerrum
We consider the problem of approximating certain combinatorial polynomials. First, we consider the problem of approximating the Tutte polynomial of a binary matroid with parameters…
The complexity of weighted and unweighted #CSP
Andrei Bulatov, Martin Dyer, Leslie Ann Goldberg +3
We give some reductions among problems in (nonnegative) weighted #CSP which restrict the class of functions that needs to be considered in computational complexity studies. Our red…
Approximating the partition function of the ferromagnetic Potts model
Leslie Ann Goldberg, Mark Jerrum
We provide evidence that it is computationally difficult to approximate the partition function of the ferromagnetic q-state Potts model when q>2. Specifically we show that the part…