Complexity and asymptotically optimal algorithms for modeling of absolutely continuous distributions

DOI10.1007/BF01095642MaRDI QIDQ1080659zbMATH OpenFDO

Authors B. B. Pokhodzej

Publication date 1986

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01095642

zbMATH Keywords

DG-tree algorithm

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) Analysis of algorithms and problem complexity (68Q25)

Review text

Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 137, 115-123 (Russian) (1984; Zbl 0593.68033).

Cites work

• Generating Exponential Random Variables
• scientific article; zbMATH DE number 3755865 (Why is no real title available?)

Cited in

(5)

• Complexity of monotone modelling algorithms for discrete distributions
• On the choice of statistical model for one-dimensional P-algorithms
• Efficient approximation of probability distributions with \(k\)-order decomposable models
• scientific article; zbMATH DE number 4129950 (Why is no real title available?)
• On Optimal Algorithms in an Asymptotic Model with Gaussian Measure

This page was built for publication: Complexity and asymptotically optimal algorithms for modeling of absolutely continuous distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1080659)