2 citations · 2 across the 4 of their papers we have counts for
4 papers · 1 filter
A Dichotomy for Boolean Complex Holant Problems with Conjugate-Closed Signature Sets
Jincheng Guan, Shuai Shao, Zhuxiao Tang
We study Boolean Holant problems with complex-valued signature sets closed under conjugation. Such sets arise naturally in tensor-network expressions for classical strong simulatio…
An LP Algorithm for Counting Eulerian Orientations Through the Lens of Quasi-polymorphism
Jincheng Guan, Shuai Shao, Ke Shi
The weighted Eulerian orientation counting problem () plays a key role in the complexity classification program for Holant problems. A recent result established an $…
New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model
Austen Fan, Jin-Yi Cai, Shuai Shao +1
We prove a complete complexity classification theorem for the planar eight-vertex model. For every parameter setting in for the eight-vertex model, the partition func…
Eulerian orientations and Hadamard codes: A novel connection via counting
Shuai Shao, Zhuxiao Tang
We discover a novel connection between two classical mathematical notions, Eulerian orientations and Hadamard codes by studying the counting problem of Eulerian orientations (\#EO)…