Geodesic
Upper bounds for the complexity of symbol sequences generated by symmetric Boolean functions
Diskretnyj analiz i issledovanie operacij, Tome 5 (1998) no. 3, pp. 38-43.

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

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