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)

zbMATH Keywords

DG-tree algorithm

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(5)

• scientific article; zbMATH DE number 4129950 (Why is no real title available?)
• On the choice of statistical model for one-dimensional \(P\)-algorithms
• Complexity of monotone modelling algorithms for discrete distributions
• Efficient approximation of probability distributions with \(k\)-order decomposable models
• 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)