Complex-valued Holant with a non-trivial odd-arity signature is classified: every instance is either #P-hard or in FPNP.
The computational complexity of Holant problems on 3-regular graphs.Theoretical Computer Science, 982:114256, 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
From an odd arity signature to a Holant dichotomy
Complex-valued Holant with a non-trivial odd-arity signature is classified: every instance is either #P-hard or in FPNP.