An Algorithm for Testing Asummability of Boolean Functions
Author :
Sureshchander
Author_Institution :
Computer Center. Indian Institute of Technology
Issue :
2
fYear :
1974
Firstpage :
188
Lastpage :
191
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.
Keywords :
m-asummability, number system, radix, threshold functions, 2-asummability.; Agriculture; Boolean functions; Linear programming; Sufficient conditions; Testing; m-asummability, number system, radix, threshold functions, 2-asummability.;
