An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
The main result establishes an \(\Omega (n^{4/3})\) lower bound on the number of \(\wedge\)-gates in any monotone network computing Boolean convolution of two Boolean n-vectors. The proof is based on a normal form of monotone networks introduced by the author.
scientific article; zbMATH DE number 3924678