Showing cs.CCShow all
3 papers · 1 filter
cs.CC2026
Group Action and Spin Representation Lead to a Holant* Complexity Dichotomy on Domain Size 3
Jin-Yi Cai, Jin Soo Ihm
We prove a complexity dichotomy theorem for problems over complex-valued symmetric constraint functions on domain size . We give a decidable tr…
cs.CC2026
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…
cs.CC2025
Holant* Dichotomy on Domain Size 3: A Geometric Perspective
Jin-Yi Cai, Jin Soo Ihm
Holant problems are a general framework to study the computational complexity of counting problems. It is a more expressive framework than counting constraint satisfaction problems…