Geodesic
Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric Boolean functions
Diskretnyj analiz i issledovanie operacij, Tome 6 (1999) no. 3, pp. 3-9.

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

@article{DA_1999_6_3_a0,
     author = {Yu. V. Merekin},
     title = {Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric {Boolean} functions},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--9},
     publisher = {mathdoc},
     volume = {6},
     number = {3},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1999_6_3_a0/}
}
TY  - JOUR
AU  - Yu. V. Merekin
TI  - Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric Boolean functions
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1999
SP  - 3
EP  - 9
VL  - 6
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1999_6_3_a0/
LA  - ru
ID  - DA_1999_6_3_a0
ER  - 
%0 Journal Article
%A Yu. V. Merekin
%T Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric Boolean functions
%J Diskretnyj analiz i issledovanie operacij
%D 1999
%P 3-9
%V 6
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1999_6_3_a0/
%G ru
%F DA_1999_6_3_a0
Yu. V. Merekin. Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric Boolean functions. Diskretnyj analiz i issledovanie operacij, Tome 6 (1999) no. 3, pp. 3-9. http://geodesic.mathdoc.fr/item/DA_1999_6_3_a0/