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.;
