Article ID Journal Published Year Pages File Type
6875557 Theoretical Computer Science 2018 11 Pages PDF
Abstract
Finally we study the multiplicative complexity of “almost all” functions. We show that every function with n bits of input and m bits of output can be computed using at most 2.5(1+o(1))m2n AND gates.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Multiplicative complexity of vector valued Boolean functions
Authors
, ,