Problem
Research questions and friction points this paper is trying to address.
Boolean Holant
complexity dichotomy
binary disequality
A Dichotomy for Complex Boolean Holant with Binary Disequality
🤖 AI Summary
本文解决了带有二元不等约束的布尔Holant问题的复杂性二分法，通过一个明确且可判定的标准来区分易处理与难处理的情况。
📝 Abstract
We prove a complexity dichotomy for Boolean Holant problems defined by arbitrary finite sets of algebraic complex-valued signatures when binary disequality is available. The tractable cases are characterized by an explicit, decidable criterion.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Complexity Dichotomy
Boolean Holant
Binary Disequality
Algebraic Signatures
🔎 Similar Papers
2023-02-07Logic in Computer ScienceCitations: 4
