Robert C. Durbeck
IEEE TACON
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.
Robert C. Durbeck
IEEE TACON
Quinn Pham, Danila Seliayeu, et al.
CASCON 2024
David A. Selby
IBM J. Res. Dev
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003