Geodesic
On upper bounds on the complexity of random number generation by probabilistic $\pi$-nets
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (1995), pp. 99-102 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{VMUMM_1995_5_a17,
     author = {R. M. Kolpakov},
     title = {On upper bounds on the complexity of random number generation by probabilistic $\pi$-nets},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {99--102},
     year = {1995},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_1995_5_a17/}
}
TY  - JOUR
AU  - R. M. Kolpakov
TI  - On upper bounds on the complexity of random number generation by probabilistic $\pi$-nets
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 1995
SP  - 99
EP  - 102
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/VMUMM_1995_5_a17/
LA  - ru
ID  - VMUMM_1995_5_a17
ER  - 
%0 Journal Article
%A R. M. Kolpakov
%T On upper bounds on the complexity of random number generation by probabilistic $\pi$-nets
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 1995
%P 99-102
%N 5
%U http://geodesic.mathdoc.fr/item/VMUMM_1995_5_a17/
%G ru
%F VMUMM_1995_5_a17
R. M. Kolpakov. On upper bounds on the complexity of random number generation by probabilistic $\pi$-nets. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (1995), pp. 99-102. http://geodesic.mathdoc.fr/item/VMUMM_1995_5_a17/