This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Algorithm for Testing Asummability of Boolean Functions
February 1974 (vol. 23 no. 2)
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.
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, Feb. 1974, doi:10.1109/T-C.1974.223885
Usage of this product signifies your acceptance of the Terms of Use.