A Dichotomy for Complex Boolean Holant with Binary Disequality
cs.CC
Submitted: 2026-08-31
Updated: 2026-11-06
Terminology
Sources
- From Holant to Quantum Entanglement and Back
- Dichotomy for Real Holant$^c$ Problems
- An LP Algorithm for Counting Eulerian Orientations Through the Lens of Quasi-polymorphism
- The $\text{FP}^\text{NP}$ versus #P dichotomy for #EO
- From an odd arity signature to a Holant dichotomy
- A Dichotomy for Real Boolean Holant Problems
- The framework to unify all complexity dichotomy theorems for Boolean tensor networks
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?