Randomized algorithms and pseudorandom numbers
From MaRDI portal
Publication:3140013
DOI10.1145/174130.174132zbMath0782.68059WikidataQ57904594 ScholiaQ57904594MaRDI QIDQ3140013
Prabhakar Raghavan, Howard J. Karloff
Publication date: 6 December 1993
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/174130.174132
68Q25: Analysis of algorithms and problem complexity
65C10: Random number generation in numerical analysis
Related Items
Improved parallel approximation of a class of integer programming problems, Golden ratio versus pi as random sequence sources for Monte Carlo integration, Primality testing with fewer random bits, Improved algorithms via approximations of probability distributions, Randomized geometric algorithms and pseudorandom generators, The Monte Carlo Algorithm with a Pseudorandom Generator