G. Ramalingam
Theoretical Computer Science
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.
G. Ramalingam
Theoretical Computer Science
Fan Zhang, Junwei Cao, et al.
IEEE TETC
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008