Fetching the paper…
Reading the bibliography…
We study the complexity of approximating the partition function $Z_{\mathrm{Ising}}(G; \beta)$ of the Ising model in terms of the relation between the edge interaction $\beta$ and a parameter $\Delta$ which is an upper bound on the maximum degree of the input graph $G$.
Beitrag zur theorie des ferromagnetismus
E. Ising · 1925
Earlier work this paper cites.
Statistical theory of equations of state and phase transitions. I. Theory of condensation
C. N. Yang and T. D. Lee · 1952
Earlier work this paper cites.
Theory of monomer-dimer systems
O. J. Heilmann and E. H. Lieb · 1972
Earlier work this paper cites.
Matchings and walks in graphs
C. D. Godsil · 1981
Earlier work this paper cites.
A general Lee-Yang theorem for one-component and multicomponent ferromagnets
E. H. Lieb and A. D. Sokal · 1981
Earlier work this paper cites.
On the computational complexity of the Jones and Tutte polynomials
F. Jaeger, D. L. Vertigan, and D. J. A. Welsh · 1990
Earlier work this paper cites.
Iteration of rational functions
A. F. Beardon · 1991
Earlier work this paper cites.
Polynomial-time approximation algorithms for the Ising model
M. Jerrum and A. Sinclair · 1993
Earlier work this paper cites.
Complexity: knots, colourings and counting
D. J. A. Welsh · 1993
Earlier work this paper cites.
Computing in the field of complex algebraic numbers
A. W. Strzeboński · 1997
Earlier work this paper cites.
The complexity of counting graph homomorphisms
M. Dyer and C. Greenhill · 2000
Earlier work this paper cites.
Statistical mechanics of equilibrium and nonequilibrium phase transitions: the Yang-Lee formalism
I. Bena, M. Droz, and A. Lipowski · 2005
Earlier work this paper cites.
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
A. D. Sokal · 2005
Earlier work this paper cites.
Dynamics in one complex variable
J. Milnor · 2006
Earlier work this paper cites.
Counting independent sets up to the tree threshold
D. Weitz · 2006
Cited alongside, same era.
Real algebraic numbers: Complexity analysis and experimentation
I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas · 2008
Cited alongside, same era.
An introduction to Riemann surfaces
T. Napier and M. Ramachandran · 2011
Cited alongside, same era.
The complexity of computing the sign of the Tutte polynomial
L. A. Goldberg and M. Jerrum · 2014
Cited alongside, same era.
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
A. Sinclair, P. Srivastava, and M. Thurley · 2014
Cited alongside, same era.
Combinatorics and complexity of partition functions
A. Barvinok · 2016
Cited alongside, same era.
Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs
R. L. Mann and M. J. Bremner · 2019
Later among the works it cites.
On a conjecture of Sokal concerning roots of the independence polynomial
H. Peters and G. Regts · 2019
Later among the works it cites.
Note on the zero-free region of the hard-core model
F. Bencs and P. Csikvári · 2020
Later among the works it cites.
Inapproximability of the independent set polynomial in the complex plane
I. Bezáková, A. Galanis, L. A. Goldberg, and D. Štefankovič · 2020
Later among the works it cites.
Zeros of ferromagnetic 2-spin systems
H. Guo, J. Liu, and P. Lu · 2020
Later among the works it cites.
Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
A. Galanis, D. Štefankovič, and E. Vigoda · 2016
Cited alongside, same era.
Holant problems for 3-regular graphs with complex edge functions
M. Kowalczyk and J. Cai · 2016
Cited alongside, same era.
The complexity of approximating complex-valued Ising and Tutte partition functions
L. A. Goldberg and H. Guo · 2017
Cited alongside, same era.
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
V. Patel and G. Regts · 2017
Cited alongside, same era.
Weighted counting of solutions to sparse systems of equations
A. Barvinok and G. Regts · 2019
Cited alongside, same era.
A deterministic algorithm for counting colorings with 2 Δ 2\Delta colors
J. Liu, A. Sinclair, and P. Srivastava · 2019
Cited alongside, same era.
A. W. Harrow, S. Mehraban, and M. Soleimanifar · 2020
Later among the works it cites.
Location of zeros for the partition function of the Ising model on bounded degree graphs
H. Peters and G. Regts · 2020
Later among the works it cites.
More on zeros and approximation of the Ising partition function
A. Barvinok and N. Barvinok · 2021
Closest in time.
The complexity of approximating the matching polynomial in the complex plane
I. Bezáková, A. Galanis, L. A. Goldberg, and D. Štefankovič · 2021
Closest in time.
Cayley trees do not determine the maximal zero-free locus of the independence polynomial
P. Buys · 2021
Closest in time.
Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial
D. de Boer, P. Buys, L. Guerini, H. Peters, and G. Regts · 2021
Closest in time.
Zeros of Holant problems: locations and algorithms
H. Guo, C. Liao, P. Lu, and C. Zhang · 2021
Closest in time.
Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
P. Buys, A. Galanis, V. Patel, and G. Regts · 2022
Closest in time.
The complexity of approximating the complex-valued Potts model
A. Galanis, L. A. Goldberg, and A. Herrera-Poyatos · 2022
Closest in time.