arXiv · 2610.00081
A Full Complexity Dichotomy for Complex-Valued Boolean Holant Problems
Abstract
A Boolean Holant problem evaluates a graph partition function specified by local signatures at its vertices. We prove a complexity dichotomy for arbitrary finite sets of algebraic complex-valued signatures on general graphs: an explicit, decidable criterion characterizes the polynomial-time cases, and every remaining case is $\#\mathsf{P}$-hard under polynomial-time Turing reductions. The proof resolves the all-even case by constructing signatures with nonzero endpoints and all remaining support on the central layer, then classifying them according to half their arity. Binary transfer groups and matching-product reconstruction provide the main tools in the small- and large-height cases, respectively.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Chenghua Liu, Boning Meng, Juqiu Wang. 2026-11-06. A Full Complexity Dichotomy for Complex-Valued Boolean Holant Problems. https://searcharxiv.com/abs/2610.00081
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.