Geodesic
The generalized complexity of linear Boolean functions
Diskretnaya Matematika, Tome 30 (2018) no. 4, pp. 88-96

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

@article{DM_2018_30_4_a7,
     author = {N. P. Red'kin},
     title = {The generalized complexity of linear {Boolean} functions},
     journal = {Diskretnaya Matematika},
     pages = {88--96},
     publisher = {mathdoc},
     volume = {30},
     number = {4},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2018_30_4_a7/}
}
TY  - JOUR
AU  - N. P. Red'kin
TI  - The generalized complexity of linear Boolean functions
JO  - Diskretnaya Matematika
PY  - 2018
SP  - 88
EP  - 96
VL  - 30
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2018_30_4_a7/
LA  - ru
ID  - DM_2018_30_4_a7
ER  - 
%0 Journal Article
%A N. P. Red'kin
%T The generalized complexity of linear Boolean functions
%J Diskretnaya Matematika
%D 2018
%P 88-96
%V 30
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2018_30_4_a7/
%G ru
%F DM_2018_30_4_a7
N. P. Red'kin. The generalized complexity of linear Boolean functions. Diskretnaya Matematika, Tome 30 (2018) no. 4, pp. 88-96. http://geodesic.mathdoc.fr/item/DM_2018_30_4_a7/