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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. S. Avsarkisyan, “Representation of Boolean functions as a sum modulo 2 of implications of arguments,” Avtom. Vychisl. Tekhn., No. 1, 8–11 (1977).
Selected Questions on Boolean Functions (Fizmatlit, Moscow, 2001) [in Russian].
S. F. Vinokurov and N. A. Peryazev, “Decomposition of Boolean functions into sums of products of proper subfunctions,” Diskret. Mat. [Discrete Math. Appl.] 5(3), 102–104 (1993).
S. F. Vinokurov and V. I. Panteleev, “Polynomial representation of Boolean functions by using only residual functions,” in Proceedings of XII Baikal International Conference (Irkutsk, 2001), Vol. 5, pp. 27–31.
Author information
Authors and Affiliations
Additional information
Original Russian Text © A. S. Zinchenko, V. I. Panteleev, 2007, published in Matematicheskie Zametki, 2007, Vol. 81, No. 2, pp. 217–225.
Rights and permissions
About this article
Cite this article
Zinchenko, A.S., Panteleev, V.I. Binary terms in polynomial representations of Boolean functions. Math Notes 81, 193–200 (2007). https://doi.org/10.1134/S0001434607010221
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1134/S0001434607010221