This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Complexity of Partially Defined Combinational Switching Functions
February 1971 (vol. 20 no. 2)
pp. 204-208
D.R. Smith, IEEE
The complexity of the switching networks necessary to realize arbitrary combinational functions is studied. Asymptotic upper and lower bounds for fully defined functions are well known, while lower bounds also exist for partially defined combinational functions. The present paper supplements these results with the upper bounds for the partially defined functions. The results have possible relevance to pattern recognition.
Index Terms:
Complexity bounds, limited fan-in, partially defined switching functions, threshold gate networks.
Citation:
D.R. Smith, "Complexity of Partially Defined Combinational Switching Functions," IEEE Transactions on Computers, vol. 20, no. 2, pp. 204-208, Feb. 1971, doi:10.1109/T-C.1971.223212
Usage of this product signifies your acceptance of the Terms of Use.