Remarks on the complexity of simulation of a ``simple geometric distribution

MaRDI QIDQ1373594zbMATH OpenFDO

Authors B. B. Pokhodzej

Publication date 29 March 1998

Published in Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexity of simulationgeometric distributionoptimal algorithms

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Probabilistic methods, stochastic differential equations (65C99) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• An optimal algorithm for simulation of true die by symmetric coin
• Complexity of monotone algorithms for the simulation of discrete distributions
• scientific article; zbMATH DE number 4110061
• scientific article; zbMATH DE number 4048803
• scientific article; zbMATH DE number 3982481

This page was built for publication: Remarks on the complexity of simulation of a ``simple geometric distribution

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