Fetching the paper…
Reading the bibliography…
We develop a theory of graph algebras over general fields.
Perfect matchings, rank of connection tensors and graph homomorphisms
J.-Y. Cai and A. Govorov · 1909
Earlier work this paper cites.
Statistical theory of equations of state and phase transitions. II. lattice gas and Ising model
T.-D. Lee and C.-N. Yang · 1952
Earlier work this paper cites.
The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice
P. W. Kasteleyn · 1961
Earlier work this paper cites.
Dimer problem in statistical mechanics-an exact result
H. N. V. Temperley and M. E. Fisher · 1961
Earlier work this paper cites.
Graph theory and crystal physics
P. W. Kasteleyn · 1967
Earlier work this paper cites.
Operations with structures
L. Lovász · 1967
Earlier work this paper cites.
Theorems on the partition functions of the Heisenberg ferromagnets
T. Asano · 1970
Earlier work this paper cites.
Zeros of the partition function for generalized Ising systems
C. M. Newman · 1974
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.
Quantum Groups in Two-Dimensional Physics
C. Gómez, M. Ruiz-Altaba, and G. Sierra · 1996
Earlier work this paper cites.
The complexity of counting graph homomorphisms
M. E. Dyer and C. S. Greenhill · 2000
Earlier work this paper cites.
The six and eight-vertex models revisited
R. J. Baxter · 2004
Earlier work this paper cites.
The complexity of partition functions
A. Bulatov and M. Grohe · 2004
Earlier work this paper cites.
Corrigendum: The complexity of counting graph homomorphisms
M. E. Dyer and C. S. Greenhill · 2004
Earlier work this paper cites.
Graphs and homomorphisms
P. Hell and J. Nešetřil · 2004
Earlier work this paper cites.
Holographic algorithms
L. G. Valiant · 2004
Cited alongside, same era.
Counting graph homomorphisms
C. Borgs, J. Chayes, L. Lovász, Vera T. Sós, and K. Vesztergombi · 2006
Cited alongside, same era.
Accidental algorithms
L. G. Valiant · 2006
Cited alongside, same era.
Towards a dichotomy theorem for the counting constraint satisfaction problem
A. A. Bulatov and V. Dalmau · 2007
Cited alongside, same era.
Reflection positivity, rank connectivity, and homomorphism of graphs
M. Freedman, L. Lovász, and A. Schrijver · 2007
Cited alongside, same era.
Edge coloring models and reflection positivity
B. Szegedy · 2007
Cited alongside, same era.
Symmetric tensors and symmetric tensor rank
Large Networks and Graph Limits
L. Lovász · 2012
Later among the works it cites.
Characterizing partition functions of the vertex model by rank growth
A. Schrijver · 2012
Later among the works it cites.
The complexity of the counting constraint satisfaction problem
A. A. Bulatov · 2013
Later among the works it cites.
Graph homomorphisms with complex values: A dichotomy theorem
J.-Y. Cai, X. Chen, and P. Lu · 2013
Later among the works it cites.
An effective dichotomy for the counting constraint satisfaction problem
M. E. Dyer and D. Richerby · 2013
Later among the works it cites.
The complexity of symmetric Boolean parity Holant problems
H. Guo, P. Lu, and L. G. Valiant · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Comon, G. Golub, L.-H. Lim, and B. Mourrain · 2008
Cited alongside, same era.
Graph parameters and semigroup functions
L. Lovász and A. Schrijver · 2008
Cited alongside, same era.
Holant problems and counting CSP
J.-Y. Cai, P. Lu, and M. Xia · 2009
Cited alongside, same era.
Graph invariants in the spin model
A. Schrijver · 2009
Cited alongside, same era.
The Complexity of Partition Functions
M. Thurley · 2009
Cited alongside, same era.
A complexity dichotomy for partition functions with mixed signs
L. A. Goldberg, M. Grohe, M. Jerrum, and M. Thurley · 2010
Cited alongside, same era.
Characterizing partition functions of the spin model by rank growth
A. Schrijver · 2013
Later among the works it cites.
A Holant dichotomy: Is the FKT algorithm universal?
J.-Y. Cai, Z. Fu, H. Guo, and T. Williams · 2015
Later among the works it cites.
Characterizing partition functions of the edge-coloring model by rank growth
A. Schrijver · 2015
Later among the works it cites.
A new Holant dichotomy inspired by quantum computation
M. Backens · 2017
Later among the works it cites.
Complexity Dichotomies for Counting Problems
J.-Y. Cai and X. Chen · 2017
Later among the works it cites.
Complexity of counting CSP with complex weights
J.-Y. Cai and X. Chen · 2017
Later among the works it cites.
Holographic algorithm with matchgates is universal for planar #CSP over Boolean domain
J.-Y. Cai and Z. Fu · 2017
Later among the works it cites.
A complete dichotomy for complex-valued Holant c
M. Backens · 2018
Later among the works it cites.