Complexity and asymptotically optimal algorithms for generating absolutely continuous distributions
Zapiski Nauchnykh Seminarov POMI, Computational complexity theory. Part II, Tome 137 (1984), pp. 115-123
Voir la notice de l'article provenant de la source Math-Net.Ru
The main purpose of this article is to study intermediate model of DG-tree algorithms for generating absolutely continuous distributions which, perhaps, includes both the finite state and the general tree algorithms.
@article{ZNSL_1984_137_a6,
author = {B. B. Pokhodzei},
title = {Complexity and asymptotically optimal algorithms for generating absolutely continuous distributions},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {115--123},
publisher = {mathdoc},
volume = {137},
year = {1984},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1984_137_a6/}
}
TY - JOUR AU - B. B. Pokhodzei TI - Complexity and asymptotically optimal algorithms for generating absolutely continuous distributions JO - Zapiski Nauchnykh Seminarov POMI PY - 1984 SP - 115 EP - 123 VL - 137 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZNSL_1984_137_a6/ LA - ru ID - ZNSL_1984_137_a6 ER -
B. B. Pokhodzei. Complexity and asymptotically optimal algorithms for generating absolutely continuous distributions. Zapiski Nauchnykh Seminarov POMI, Computational complexity theory. Part II, Tome 137 (1984), pp. 115-123. http://geodesic.mathdoc.fr/item/ZNSL_1984_137_a6/