Preprint
Sep 2026
A Full Complexity Dichotomy for Complex-Valued Boolean Holant Problems
We prove a complexity dichotomy for Boolean Holant problems defined by arbitrary finite sets of algebraic complex-valued signatures. The tractable cases are characterized by an explicit, decidable criterion.
Cheng-Hua Liu, Bo-Ning Meng, Ju-Qiu Wang
· 0 citations