A Full Complexity Dichotomy for Complex-Valued Boolean Holant Problems
arXiv:2610.00081
Abstract
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.