Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
Neumann J. von. Various techniques used in connection with random digits. — In:Collected Works,vol.5 — London: Pergamon Press, 1963,pp.768–770.
Ermakov S.M. The Monte-Carlo Method and related questions. — Izd. M.: Nauka,1971,p.327.
Knuth D.,Yao A. The complexity of non-uniform random numbers generation in algorithm and complexity. — New-York, Academy Press, 1976,pp.357–428.
Pokhodzey B.B. Complexity and optimal algorithms of modelling "truncated" geometric and discrete uniform distributions. — Vest.Leningr.Uni.,1986,ser.I,vip.2,pp.118–119.
Pokhodzey B.B. Optimal method of generating Bernoulli distributions. — ENGRG, New-York, Academic Press,1976,pp.357–428.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ermakov, S.M., Pokhodzey, B.B. (1987). Discrete analogue of the Neumann method is not optimal. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_26
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18740-0
Online ISBN: 978-3-540-48138-6
eBook Packages: Springer Book Archive