Lower bound for monotone Boolean convolution
Abstract
Any monotone Boolean circuit computing the n-dimensional Boolean convolution requires at least n2 and-gates. This precisely matches the obvious upper bound.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.