Fetching the paper…
Reading the bibliography…
We study the complexity of approximating the independent set polynomial $Z_G(\lambda)$ of a graph $G$ with maximum degree $\Delta$ when the activity $\lambda$ is a complex number.
Relative distance—an error measure in round-off error analysis
Abraham Ziv · 1982
Earlier work this paper cites.
NP is as easy as detecting unique solutions
Leslie G. Valiant and Vijay V. Vazirani · 1986
Earlier work this paper cites.
Iteration of rational functions: complex analytic dynamical systems
Alan F. Beardon · 1991
Earlier work this paper cites.
An efficient algorithm for the complex roots problem
C. Andrew Neff and John H. Reif · 1996
Earlier work this paper cites.
Approximation by Algebraic Numbers
Yann Bugeaud · 2004
Earlier work this paper cites.
The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
Alexander D. Scott and Alan D. Sokal · 2005
Earlier work this paper cites.
Dynamics in One Complex Variable
Jonh W. Milnor · 2006
Cited alongside, same era.
Counting independent sets up to the tree threshold
Dror Weitz · 2006
Cited alongside, same era.
The roots of the independence polynomial of a clawfree graph
Maria Chudnovsky and Paul D. Seymour · 2007
Cited alongside, same era.
Counting in two-spin models on d-regular graphs
Allan Sly and Nike Sun · 2014
Cited alongside, same era.
Inapproximability of the independent set polynomial below the Shearer threshold
Andreas Galanis, Leslie Ann Goldberg, and Daniel Štefankovič · 2017
Cited alongside, same era.
The complexity of approximating complex-valued Ising and Tutte partition functions
Leslie Ann Goldberg and Heng Guo · 2017
Cited alongside, same era.
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
Viresh Patel and Guus Regts · 2017
Closest in time.
Note on the zero-free region of the hard-core model
Ferenc Bencs and Péter Csikvári · 2018
Closest in time.
Computing the independence polynomial: from the tree threshold down to the roots
Nicholas J. A. Harvey, Piyush Srivastava, and Jan Vondrák · 2018
Closest in time.
On the location of roots of the independence polynomial of bounded degree graphs
Pjotr Buys · 2019
Closest in time.
On a conjecture of Sokal concerning roots of the independence polynomial
Han Peters and Guus Regts · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Juan Rivera-Letelier · 2019
Closest in time.