Abstract:
Polynomial representations of Boolean functions by binary terms are considered. The construction of terms involves variables and residual functions. Special cases of such representations are the decomposition of a function with respect to variables, Zhegalkin polynomials, and representations of functions as sums of conjunctions of residual functions.
Keywords:representation of Boolean functions by binary terms, Zhegalkin polynomial, polynomial representation of Boolean functions.