The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1974 vol.23)
pp: 188-191
null Sureshchander , Computer Center. Indian Institute of Technology
ABSTRACT
An algorithm is described in this note to determine whether a switching function is asummable or not. The algorithm is efficient and simple for testing 2-asummability.
INDEX TERMS
m-asummability, number system, radix, threshold functions, 2-asummability.
CITATION
null Sureshchander, "An Algorithm for Testing Asummability of Boolean Functions", IEEE Transactions on Computers, vol.23, no. 2, pp. 188-191, February 1974, doi:10.1109/T-C.1974.223885
47 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool