Title :
An iterative algorithm for testing two-asummability of boolean functions
Author_Institution :
Indian Statistical Institute, Calcutta, India
Abstract :
An iterative algorithm for testing two-asummability of any given Boolean function is described in this letter. The method is based on the decomposition of Boolean functions in terms of reduced functions, and it is suitable for machine computation.
Keywords :
Boolean functions; Flowcharts; Iterative algorithms; Logic functions; Sufficient conditions; Testing;
Journal_Title :
Proceedings of the IEEE
DOI :
10.1109/PROC.1981.12139
