2000 character limit reached
Lower bound for monotone Boolean convolution (1708.03523v3)
Published 11 Aug 2017 in cs.CC
Abstract: Any monotone Boolean circuit computing the $n$-dimensional Boolean convolution requires at least $n2$ and-gates. This precisely matches the obvious upper bound.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.