On the Time Necessary to Compute Switching Functions
Philip M. Spira · IEEE Transactions on Computers · 1971
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.