On the Time Necessary to Compute Switching Functions
- 1 January 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (1) , 104-105
- https://doi.org/10.1109/t-c.1971.223089
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.Keywords
This publication has 4 references indexed in Scilit:
- The Time Required for Group MultiplicationJournal of the ACM, 1969
- On the Time Required to Perform MultiplicationJournal of the ACM, 1967
- Computation times for finite groups, semigroups and automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1967
- On the Time Required to Perform AdditionJournal of the ACM, 1965