R. M. Kolpakov, “On upper bounds on the complexity of random number generation by probabilistic <nobr>$\pi$</nobr>-nets”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1995, Number 5,Pages <nobr>99

JOURNALS // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika // Archive

Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1995 Number 5, Pages 99–102 (Mi vmumm2177)

This article is cited in 1 paper

Short notes

On upper bounds on the complexity of random number generation by probabilistic $\pi$-nets

R. M. Kolpakov

UDC: 519.714.2

Received: 14.12.1994

Fulltext: PDF file (479 kB)
Cited by

Bibliographic databases: