Geodesic
On the complexity of symbol sequences defined by linear Boolean functions
Sibirskij žurnal industrialʹnoj matematiki, Tome 1 (1998) no. 1, pp. 145-147.

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

@article{SJIM_1998_1_1_a13,
     author = {Yu. V. Merekin},
     title = {On the complexity of symbol sequences defined by linear {Boolean} functions},
     journal = {Sibirskij \v{z}urnal industrialʹnoj matematiki},
     pages = {145--147},
     publisher = {mathdoc},
     volume = {1},
     number = {1},
     year = {1998},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJIM_1998_1_1_a13/}
}
TY  - JOUR
AU  - Yu. V. Merekin
TI  - On the complexity of symbol sequences defined by linear Boolean functions
JO  - Sibirskij žurnal industrialʹnoj matematiki
PY  - 1998
SP  - 145
EP  - 147
VL  - 1
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJIM_1998_1_1_a13/
LA  - ru
ID  - SJIM_1998_1_1_a13
ER  - 
%0 Journal Article
%A Yu. V. Merekin
%T On the complexity of symbol sequences defined by linear Boolean functions
%J Sibirskij žurnal industrialʹnoj matematiki
%D 1998
%P 145-147
%V 1
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJIM_1998_1_1_a13/
%G ru
%F SJIM_1998_1_1_a13
Yu. V. Merekin. On the complexity of symbol sequences defined by linear Boolean functions. Sibirskij žurnal industrialʹnoj matematiki, Tome 1 (1998) no. 1, pp. 145-147. http://geodesic.mathdoc.fr/item/SJIM_1998_1_1_a13/