Abstract:
The classes of Boolean functions that are implemented by linear rithmetic polynomials are studied. The notion of composition of arithmetic polynomials is introduced. A composition of linear arithmetic polynomials is shown to be able to represent an arbitrary cortege of Boolean functions. The cortege implementation consists in successive computation of the polynomials which make the composition.