DocumentCode
1106371
Title
On the Time Necessary to Compute Switching Functions
Author
Spira, Philip M.
Author_Institution
IEEE
Issue
1
fYear
1971
Firstpage
104
Lastpage
105
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
Circuits of elements with limited fan-in, computational complexity, gate circuits, switching theory, time of computation.; Application software; Asynchronous circuits; Automata; Computer networks; Control systems; Information processing; Integrated circuit interconnections; Logic; Switching circuits; Upper bound; Circuits of elements with limited fan-in, computational complexity, gate circuits, switching theory, time of computation.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1971.223089
Filename
1671682
Link To Document