On the affinity level of Boolean functions
Diskretnaya Matematika, Tome 17 (2005) no. 4, pp. 98-107
Voir la notice de l'article provenant de la source Math-Net.Ru
We study properties of the parameter of a Boolean function known as
the affinity level,
which characterises the efficiency of the linearisation method of solving
systems of Boolean equations, and relations between this parameter and
parameters characterising other properties of Boolean functions.
@article{DM_2005_17_4_a8,
author = {M. L. Buryakov and O. A. Logachev},
title = {On the affinity level of {Boolean} functions},
journal = {Diskretnaya Matematika},
pages = {98--107},
publisher = {mathdoc},
volume = {17},
number = {4},
year = {2005},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2005_17_4_a8/}
}
M. L. Buryakov; O. A. Logachev. On the affinity level of Boolean functions. Diskretnaya Matematika, Tome 17 (2005) no. 4, pp. 98-107. http://geodesic.mathdoc.fr/item/DM_2005_17_4_a8/