Geodesic
Lower bounds for the formula complexity of symmetric Boolean functions
Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 3, pp. 86-98.

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

@article{DA_2000_7_3_a5,
     author = {D. Yu. Cherukhin},
     title = {Lower bounds for the formula complexity of symmetric {Boolean} functions},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {86--98},
     publisher = {mathdoc},
     volume = {7},
     number = {3},
     year = {2000},
     language = {ru},
     url = {https://geodesic-test.mathdoc.fr/item/DA_2000_7_3_a5/}
}
TY  - JOUR
AU  - D. Yu. Cherukhin
TI  - Lower bounds for the formula complexity of symmetric Boolean functions
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2000
SP  - 86
EP  - 98
VL  - 7
IS  - 3
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/DA_2000_7_3_a5/
LA  - ru
ID  - DA_2000_7_3_a5
ER  - 
%0 Journal Article
%A D. Yu. Cherukhin
%T Lower bounds for the formula complexity of symmetric Boolean functions
%J Diskretnyj analiz i issledovanie operacij
%D 2000
%P 86-98
%V 7
%N 3
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/DA_2000_7_3_a5/
%G ru
%F DA_2000_7_3_a5
D. Yu. Cherukhin. Lower bounds for the formula complexity of symmetric Boolean functions. Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 3, pp. 86-98. https://geodesic-test.mathdoc.fr/item/DA_2000_7_3_a5/