Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
In his paper "On a Boolean matrix", Nechiporuk gave an explicit example of a set of n homogeneous monotone Boolean functions of the first degree in n variables that require Ω(n3/2) two-input gates in any monotone Boolean network computing them. In this note we show how this can be extended to Ω(n5/3) two-input gates. © 1980.
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
G. Ramalingam
Theoretical Computer Science
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev