Fetching the paper…
Reading the bibliography…
Holant problem is a general framework to study the computational complexity of counting problems.
Operations with structures
L. Lovász · 1967
Earlier work this paper cites.
On the structure of polynomial time reducibility
R. E. Ladner · 1975
Earlier work this paper cites.
On the complexity of H-coloring
P. Hell and J. Nešetřil · 1990
Earlier work this paper cites.
Complexity of generalized satisfiability counting problems
N. Creignou and M. Hermann · 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 complexity of partition functions
A. A. Bulatov and M. Grohe · 2005
Earlier work this paper cites.
Accidental algorithms
L. G. Valiant · 2006
Earlier work this paper cites.
Towards a dichotomy theorem for the counting constraint satisfaction problem
A. A. Bulatov and V. Dalmau · 2007
Earlier work this paper cites.
On counting homomorphisms to directed acyclic graphs
M. E. Dyer, L. A. Goldberg, and M. Paterson · 2007
Earlier work this paper cites.
Reflection positivity, rank connectivity, and homomorphism of graphs
M. Freedman, L. Lovász, and A. Schrijver · 2007
Earlier work this paper cites.
Holographic algorithms
L. G. Valiant · 2008
Earlier work this paper cites.
The complexity of weighted Boolean #CSP with mixed signs
A. A. Bulatov, M. E. Dyer, L. A. Goldberg, M. Jalsenius, and D. Richerby · 2009
Cited alongside, same era.
Holant problems and counting CSP
J.-Y. Cai, P. Lu, and M. Xia · 2009
Cited alongside, same era.
The complexity of weighted Boolean #CSP
M. E. Dyer, L. A. Goldberg, and M. Jerrum · 2009
Cited alongside, same era.
A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights
J.-Y. Cai and X. Chen · 2010
Cited alongside, same era.
On the complexity of #CSP
M. E. Dyer and D. Richerby · 2010
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.
From Holant to #CSP and back: Dichotomy for Holant c
J.-Y. Cai, S. Huang, and P. Lu · 2012
Later among the works it cites.
A dichotomy for real weighted Holant problems
S. Huang and P. Lu · 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.
A complete dichotomy rises from the capture of vanishing signatures: Extended abstract
J.-Y. Cai, H. Guo, and T. Williams · 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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Non-negatively weighted #CSP: An effective complexity dichotomy
J.-Y. Cai, X. Chen, and P. Lu · 2011
Cited alongside, same era.
Computational complexity of Holant problems
J.-Y. Cai, P. Lu, and M. Xia · 2011
Cited alongside, same era.
Dichotomy for Holant ∗ problems of Boolean domain
J.-Y. Cai, P. Lu, and M. Xia · 2011
Cited alongside, same era.
The complexity of weighted and unweighted #CSP
A. A. Bulatov, M. E. Dyer, L. A. Goldberg, M. Jalsenius, M. Jerrum, and D. Richerby · 2012
Cited alongside, same era.
Complexity of counting CSP with complex weights
J.-Y. Cai and X. Chen · 2012
Cited alongside, same era.
The complexity of symmetric Boolean parity Holant problems
H. Guo, P. Lu, and L. G. Valiant · 2013
Later among the works it cites.
Holographic algorithms beyond matchgates
J.-Y. Cai, H. Guo, and T. Williams · 2014
Later among the works it cites.
The complexity of complex weighted Boolean #CSP
J.-Y. Cai, P. Lu, and M. Xia · 2014
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.
Holographic algorithm with matchgates is universal for planar #CSP over Boolean domain
J.-Y. Cai and Z. Fu · 2016
Closest in time.