A Boolean Analysis of Addition and Multiplication

Authors :: Faltin, F.
Metropolis, N.
Ross, B.
Rota, G.-C.
Source :: Studies in Applied Mathematics; April 1977, Vol. 56 Issue: 2 p147-158, 12p
Publication Year :: 1977
Abstract: The notions of binary string and binary symmetric function are introduced and basic results presented. Boolean algorithms are given for binary addition and multiplication. An analysis of the redundancies involved is straightforward. The examination of carry propagation which arises in the Boolean analysis of functions may lead to a new interpretation of the notion of computational complexity.