Fetching the paper…
Reading the bibliography…
In this paper, I consider a fine-grained dichotomy of Boolean counting constraint satisfaction problem (#CSP), under the exponential time hypothesis of counting version (#ETH).
The complexity of computing the permanent
Leslie G Valiant · 1979
Earlier work this paper cites.
The complexity of enumeration and reliability problems
Leslie G Valiant · 1979
Earlier work this paper cites.
Complexity of generalized satisfiability counting problems
Nadia Creignou and Miki Hermann · 1996
Earlier work this paper cites.
The complexity of counting graph homomorphisms
Martin Dyer and Catherine Greenhill · 2000
Earlier work this paper cites.
On the complexity of k-sat
Russell Impagliazzo and Ramamohan Paturi · 2001
Earlier work this paper cites.
Which problems have strongly exponential complexity?
Russell Impagliazzo, Ramamohan Paturi, and Francis Zane · 2001
Earlier work this paper cites.
The complexity of counting in sparse, regular, and planar graphs
Salil P. Vadhan · 2001
Earlier work this paper cites.
Accidental algorthims
Leslie G Valiant · 2006
Earlier work this paper cites.
Reflection positivity, rank connectivity, and homomorphism of graphs
Michael, Freedman, László, Lovász, Alexander, and Schrijver · 2007
Earlier work this paper cites.
Holographic algorithms by fibonacci gates and holographic reductions for hardness
Jin-Yi Cai, Pinyan Lu, and Mingji Xia · 2008
Cited alongside, same era.
Leslie G Valiant · 2008
Cited alongside, same era.
The complexity of weighted boolean# csp with mixed signs
Andrei Bulatov, Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius, and David Richerby · 2009
Cited alongside, same era.
The complexity of weighted boolean# csp
Martin Dyer, Leslie Ann Goldberg, and Mark Jerrum · 2009
Cited alongside, same era.
The complexity of complex weighted boolean# csp
Jin-Yi Cai, Pinyan Lu, and Mingji Xia · 2014
Cited alongside, same era.
Exponential time complexity of the permanent and the tutte polynomial
Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, and Martin Wahlen · 2014
Complexity classification of the six-vertex model
Jin-Yi Cai, Zhiguo Fu, and Mingji Xia · 2018
Later among the works it cites.
Dichotomy for real holantĉ problems
Jin-Yi Cai, Pinyan Lu, and Mingji Xia · 2018
Later among the works it cites.
Block interpolation: A framework for tight exponential-time counting complexity
Radu Curticapean · 2018
Later among the works it cites.
The complexity of boolean holant problems with nonnegative weights
Jiabao Lin and Hanpin Wang · 2018
Later among the works it cites.
Fine-grained dichotomies for the tutte plane and boolean #csp
Cornelius Brand, Holger Dell, and Marc Roth · 2019
Later among the works it cites.
The exponential-time complexity of counting (quantum) graph homomorphisms
Hubie Chen, Radu Curticapean, and Holger Dell · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Parameterizing the permanent: Genus, apices, minors, evaluation mod 2k
Radu Curticapean and Mingji Xia · 2015
Cited alongside, same era.
Complexity of counting csp with complex weights
Jin-Yi Cai and Xi Chen · 2017
Cited alongside, same era.
A complete dichotomy for complex-valued holantˆc
Miriam Backens · 2018
Cited alongside, same era.
Dichotomy for holant* problems of boolean domain
Jin-Yi Cai, Pinyan Lu, and Mingji Xia · 2020
Later among the works it cites.
A dichotomy for real boolean holant problems
Shuai Shao and Jin-Yi Cai · 2020
Later among the works it cites.