Issue No. 05 - May (1972 vol. 21)
W.E. Hansalik , Univac Division, Sperry Rand Corporation
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.
Bound, complexity, function, realization, switching.
W. Hansalik, "A Lower Bound on the Complexity of Arbitrary Switching Function Realizers," in IEEE Transactions on Computers, vol. 21, no. , pp. 507-510, 1972.