The Community for Technology Leaders
Green Image
Issue No. 02 - February (1974 vol. 23)
ISSN: 0018-9340
pp: 188-191
null Sureshchander , Computer Center. Indian Institute of Technology
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.
m-asummability, number system, radix, threshold functions, 2-asummability.
null Sureshchander, "An Algorithm for Testing Asummability of Boolean Functions", IEEE Transactions on Computers, vol. 23, no. , pp. 188-191, February 1974, doi:10.1109/T-C.1974.223885
96 ms
(Ver 3.3 (11022016))