DocumentCode
1107644
Title
Complexity of Partially Defined Combinational Switching Functions
Author
Smith, David R.
Author_Institution
IEEE
Issue
2
fYear
1971
Firstpage
204
Lastpage
208
Abstract
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.
Keywords
Complexity bounds, limited fan-in, partially defined switching functions, threshold gate networks.; Neural networks; Pattern recognition; Upper bound; Complexity bounds, limited fan-in, partially defined switching functions, threshold gate networks.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1971.223212
Filename
1671805
Link To Document