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

中文翻译：

---

单调布尔卷积的下限

任何计算 $n$ 维布尔卷积的单调布尔电路至少需要 $n^2$ 和门。这与明显的上限精确匹配。