Zapiski Nauchnykh Seminarov POMI, Computational complexity theory. Part II, Tome 137 (1984), pp. 115-123
Citer cet article
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/
@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},
year = {1984},
volume = {137},
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
UR - http://geodesic.mathdoc.fr/item/ZNSL_1984_137_a6/
LA - ru
ID - ZNSL_1984_137_a6
ER -
%0 Journal Article
%A B. B. Pokhodzei
%T Complexity and asymptotically optimal algorithms for generating absolutely continuous distributions
%J Zapiski Nauchnykh Seminarov POMI
%D 1984
%P 115-123
%V 137
%U http://geodesic.mathdoc.fr/item/ZNSL_1984_137_a6/
%G ru
%F ZNSL_1984_137_a6
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.
