DocumentCode
964002
Title
An iterative algorithm for testing two-asummability of boolean functions
Author
Pal, Ajit
Author_Institution
Indian Statistical Institute, Calcutta, India
Volume
69
Issue
9
fYear
1981
Firstpage
1164
Lastpage
1166
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;
fLanguage
English
Journal_Title
Proceedings of the IEEE
Publisher
ieee
ISSN
0018-9219
Type
jour
DOI
10.1109/PROC.1981.12139
Filename
1456407
Link To Document