The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1972 vol.21)
pp: 507-510
W.E. Hansalik , Univac Division, Sperry Rand Corporation
ABSTRACT
In this note, arbitrary switching function realizers and their complexity are defined. Then, a lower bound on the complexity is derived in terms of the number of such switching function realizers required to realize all Boolean functions of n variables.
INDEX TERMS
Bound, complexity, function, realization, switching.
CITATION
W.E. Hansalik, "A Lower Bound on the Complexity of Arbitrary Switching Function Realizers", IEEE Transactions on Computers, vol.21, no. 5, pp. 507-510, May 1972, doi:10.1109/T-C.1972.223552
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool