Mike S. Paterson

Lower bound for monotone Boolean convolution

Any monotone Boolean circuit computing the $n$-dimensional Boolean convolution requires at least $n^2$ and-gates. This precisely matches the obvious upper bound.