The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1971 vol.20)
pp: 104-105
P.M. Spira , IEEE
ABSTRACT
In this note we establish a new upper bound on the time to compute classes of switching functions. As did Shannon and Lupanov in their study of the number of elements necessary to compute switching functions, we base our method on a Shannon expansion about a certain number of variables of the function being computed.
INDEX TERMS
Circuits of elements with limited fan-in, computational complexity, gate circuits, switching theory, time of computation.
CITATION
P.M. Spira, "On the Time Necessary to Compute Switching Functions", IEEE Transactions on Computers, vol.20, no. 1, pp. 104-105, January 1971, doi:10.1109/T-C.1971.223089
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool