An iterative algorithm for testing two-asummability of boolean functions

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.