no code implementations • 10 Feb 2021 • Yuan Li, Frank Ingram, Huaming Zhang
For both Boolean values $b\in\{0, 1\}$, we obtain a formula for $b$-certificate complexity and consequently, we develop a direct proof of the certificate complexity formula of an NCF.
Combinatorics Discrete Mathematics
