Fetching the paper…
Reading the bibliography…
We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials.
Molecular distribution
Joseph E. Mayer and Elliott Montroll · 1941
Earlier work this paper cites.
General properties of polymer systems
Christian Gruber and Hervé Kunz · 1971
Earlier work this paper cites.
Theory of Monomer-Dimer systems
Ole J. Heilmann and Elliott H. Lieb · 1972
Earlier work this paper cites.
Random generation of combinatorial structures from a uniform distribution
Mark Jerrum, Leslie G. Valiant, and Vijay V. Vazirani · 1986
Earlier work this paper cites.
Cluster expansion for abstract polymer models
Roman Kotecký and David Preiss · 1986
Earlier work this paper cites.
Approximating the permanent
Mark Jerrum and Alistair Sinclair · 1989
Earlier work this paper cites.
Approximate counting, uniform generation and rapidly mixing markov chains
Alistair Sinclair and Mark Jerrum · 1989
Earlier work this paper cites.
Polynomial-time approximation algorithms for the Ising model
Mark Jerrum and Alistair Sinclair · 1993
Earlier work this paper cites.
Estimates of semiinvariants for the ising model at low temperatures
Roland L. Dobrushin · 1996
Earlier work this paper cites.
Graph orientations with no sink and an approximation for a hard case of #SAT
Russ Bubley and Martin Dyer · 1997
Earlier work this paper cites.
Complexity and approximation: combinatorial optimization problems and their approximability properties
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, and Viggo Kann · 1999
Earlier work this paper cites.
Random walks on combinatorial objects
Martin Dyer and Catherine Greenhill · 1999
Earlier work this paper cites.
The relative complexity of approximate counting problems
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, and Mark Jerrum · 2004
Earlier work this paper cites.
Counting independent sets up to the tree threshold
Dror Weitz · 2006
Earlier work this paper cites.
Holographic algorithms
Leslie G. Valiant · 2008
Earlier work this paper cites.
Computational transition at the uniqueness threshold
Allan Sly · 2010
Cited alongside, same era.
Computational complexity of Holant problems
Jin-yi Cai, Pinyan Lu, and Mingji Xia · 2011
Cited alongside, same era.
On the roots of edge cover polynomials of graphs
Péter Csikvári and Mohammad Reza Oboudi · 2011
Cited alongside, same era.
Left and right convergence of graphs with bounded degree
Christian Borgs, Jennifer T. Chayes, Jeff Kahn, and László Lovász · 2013
Cited alongside, same era.
Dichotomy for Holant* problems with domain size 3
Jin-Yi Cai, Pinyan Lu, and Mingji Xia · 2013
Cited alongside, same era.
Approximating Holant problems by winding
Colin McQuillan · 2013
Cited alongside, same era.
The complexity of Holant problems over Boolean domain with non-negative weights
Jiabao Lin and Hanpin Wang · 2017
Later among the works it cites.
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
Viresh Patel and Guus Regts · 2017
Later among the works it cites.
A complete dichotomy for complex-valued Holant c
Miriam Backens · 2018
Later among the works it cites.
Dichotomy for real Holant c problems
Jin-Yi Cai, Pinyan Lu, and Mingji Xia · 2018
Later among the works it cites.
The ising partition function: Zeros and deterministic approximation
Jingcheng Liu, Alistair Sinclair, and Piyush Srivastava · 2018
Later among the works it cites.
Zero-free regions of partition functions with applications to algorithms and graph limits
Guus Regts · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
Jin-Yi Cai, Heng Guo, and Tyson Williams · 2014
Cited alongside, same era.
Improved inapproximability results for counting independent sets in the hard-core model
Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, and Linji Yang · 2014
Cited alongside, same era.
FPTAS for counting weighted edge covers
Jingcheng Liu, Pinyan Lu, and Chihao Zhang · 2014
Cited alongside, same era.
FPTAS for weighted Fibonacci gates and its applications
Pinyan Lu, Menghui Wang, and Chihao Zhang · 2014
Cited alongside, same era.
Combinatorics and Complexity of Partition Functions
Alexander I. Barvinok · 2016
Cited alongside, same era.
Computing the permanent of (some) complex matrices
Alexander I. Barvinok · 2016
Cited alongside, same era.
Later among the works it cites.
Weighted counting of solutions to sparse systems of equations
Alexander Barvinok and Guus Regts · 2019
Closest in time.
The Complexity of Approximating the Matching Polynomial in the Complex Plane
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, and Daniel Stefankovic · 2019
Closest in time.
Counting perfect matchings and the eight-vertex model
Jin-Yi Cai and Tianyu Liu · 2019
Closest in time.
Approximability of the six-vertex model
Jin-Yi Cai, Tianyu Liu, and Pinyan Lu · 2019
Closest in time.
Fast algorithms at low temperatures via markov chains
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, and Eric Vigoda · 2019
Closest in time.
Zeros of Holant problems: locations and algorithms
Heng Guo, Chao Liao, Pinyan Lu, and Chihao Zhang · 2019
Closest in time.
Algorithmic Pirogov-Sinai theory
Tyler Helmuth, Will Perkins, and Guus Regts · 2019
Closest in time.
On a conjecture of Sokal concerning roots of the independence polynomial
Han Peters and Guus Regts · 2019
Closest in time.