On the complexity of binary floating point pseudorandom generation

DOI10.1515/MCMA-2016-0105zbMath1338.65009OpenAlexW2517016849MaRDI QIDQ293511

Vladimir Nekrutkin

Publication date: 9 June 2016

Published in: Monte Carlo Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/mcma-2016-0105

zbMATH Keywords

pseudorandom generatorsbinary floating point numberscomplexity of simulation

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Stochastic computational methods and experiment design ⋮ Binary decompositions of probability densities and random-bit simulation

Cites Work

• Unnamed Item
• Sharp entropy bounds for discrete statistical simulation
• A PRNG Specialized in Double Precision Floating Point Numbers Using an Affine Transition
• Interval algorithm for random number generation

This page was built for publication: On the complexity of binary floating point pseudorandom generation