On the mean time of the computation of polynomially reducible Boolean functions
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 1 (1998), pp. 68-71

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

@article{VMUMM_1998_1_a17,
     author = {A. V. Chashkin},
     title = {On the mean time of the computation of polynomially reducible {Boolean} functions},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {68--71},
     publisher = {mathdoc},
     number = {1},
     year = {1998},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_1998_1_a17/}
}
TY  - JOUR
AU  - A. V. Chashkin
TI  - On the mean time of the computation of polynomially reducible Boolean functions
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 1998
SP  - 68
EP  - 71
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_1998_1_a17/
LA  - ru
ID  - VMUMM_1998_1_a17
ER  - 
%0 Journal Article
%A A. V. Chashkin
%T On the mean time of the computation of polynomially reducible Boolean functions
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 1998
%P 68-71
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_1998_1_a17/
%G ru
%F VMUMM_1998_1_a17
A. V. Chashkin. On the mean time of the computation of polynomially reducible Boolean functions. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 1 (1998), pp. 68-71. http://geodesic.mathdoc.fr/item/VMUMM_1998_1_a17/