11 citations · 29 across the 12 of their papers we have counts for
4 papers · 1 filter
On Blockwise Symmetric Matchgate Signatures and Higher Domain \#CSP
Zhiguo Fu
For any and , we prove that the {\sc Equality} function on variables over a domain of size cannot be realized by matchgates under holographic tr…
New Planar P-time Computable Six-Vertex Models and a Complete Complexity Classification
Jin-Yi Cai, Zhiguo Fu, Shuai Shao
We discover new P-time computable six-vertex models on planar graphs beyond Kasteleyn's algorithm for counting planar perfect matchings. We further prove that there are no more: To…
Complexity Classification of the Eight-Vertex Model
Jin-Yi Cai, Zhiguo Fu
We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solva…
Complexity Classification Of The Six-Vertex Model
Jin-Yi Cai, Zhiguo Fu, Mingji Xia
We prove a complexity dichotomy theorem for the six-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvabl…