Lower bound for monotone Boolean convolution

08/11/2017

∙

by   Mike S. Paterson, et al.

∙

0

∙

share

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