Thomas M. Cover
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.
Thomas M. Cover
IEEE Trans. Inf. Theory
Pradip Bose
VTS 1998
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
Elliot Linzer, M. Vetterli
Computing