Geodesic
On the mean complexity of Boolean functions defined by Zhegalkin polynomials
Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 3, pp. 3-15.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2004_11_3_a0,
     author = {R. N. Zabaluev},
     title = {On the mean complexity of {Boolean} functions defined by {Zhegalkin} polynomials},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--15},
     publisher = {mathdoc},
     volume = {11},
     number = {3},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2004_11_3_a0/}
}
TY  - JOUR
AU  - R. N. Zabaluev
TI  - On the mean complexity of Boolean functions defined by Zhegalkin polynomials
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2004
SP  - 3
EP  - 15
VL  - 11
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2004_11_3_a0/
LA  - ru
ID  - DA_2004_11_3_a0
ER  - 
%0 Journal Article
%A R. N. Zabaluev
%T On the mean complexity of Boolean functions defined by Zhegalkin polynomials
%J Diskretnyj analiz i issledovanie operacij
%D 2004
%P 3-15
%V 11
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2004_11_3_a0/
%G ru
%F DA_2004_11_3_a0
R. N. Zabaluev. On the mean complexity of Boolean functions defined by Zhegalkin polynomials. Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 3, pp. 3-15. http://geodesic.mathdoc.fr/item/DA_2004_11_3_a0/

[1] Zabaluev R. N., “O slozhnosti realizatsii polinomov Zhegalkina”, Diskretnaya matematika, 16:1 (2004), 79–94 | MR | Zbl

[2] Chashkin A. V., “O srednem vremeni vychisleniya znachenii bulevykh funktsii”, Diskret. analiz i issled. operatsii. Ser. 1, 4:1 (1997), 60–78 | MR | Zbl

[3] Chashkin A. V., “Ob odnom metode vychisleniya chastichnykh bulevykh funktsii”, Mat. voprosy kibernetiki, no. 12, Nauka, M., 2004, 231–246

[4] Yablonskii S. V., Vvedenie v diskretnuyu matematiku, Nauka, M., 1986 | MR