About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
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. Copyright © 1971 by The Institute of Electrical and Electronics Engineers, Inc.