Binary Terms in Polynomial Representations of Boolean Functions
Matematičeskie zametki, Tome 81 (2007) no. 2, pp. 217-225
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{MZM_2007_81_2_a5,
author = {A. S. Zinchenko and V. I. Panteleev},
title = {Binary {Terms} in {Polynomial} {Representations} of {Boolean} {Functions}},
journal = {Matemati\v{c}eskie zametki},
pages = {217--225},
publisher = {mathdoc},
volume = {81},
number = {2},
year = {2007},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2007_81_2_a5/}
}
A. S. Zinchenko; V. I. Panteleev. Binary Terms in Polynomial Representations of Boolean Functions. Matematičeskie zametki, Tome 81 (2007) no. 2, pp. 217-225. http://geodesic.mathdoc.fr/item/MZM_2007_81_2_a5/