This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Time Necessary to Compute Switching Functions
January 1971 (vol. 20 no. 1)
pp. 104-105
P.M. Spira, IEEE
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, Jan. 1971, doi:10.1109/T-C.1971.223089
Usage of this product signifies your acceptance of the Terms of Use.