Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lower bound for monotone Boolean convolution

Published 11 Aug 2017 in cs.CC | (1708.03523v3)

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

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up