A Dichotomy for Complex Boolean Holant with Binary Disequality
Chenghua Liu, Boning Meng
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.
Create a lesson
Related papers
Bounded Relative Boundary Implies Narrow DNF Approximation
Chenghua Liu, Boning Meng
Upper and lower bounds on the OBDD-width of a special integer multiplication
Tong Qin
An Optimal Separation Between Certificate Complexity and Approximate Degree
Kaspars Balodis
Unrestricted Boolean Multiplicative Complexity of Four-Term Binary Polynomial Multiplication: Rational Places, Hasse Jets, and the Failure of Nonlinear Feedback
Gregory Morse
A note on the Σ2P-completeness of the Frobenius number
Thomas Rothvoss
The Complexity of Coverability-Like Problems in Elementary Object Systems: Data-Nets to the Rescue
Francesco Di Cosmo, Soumodev Mal, Tephilla Prince