Realistic analysis of some randomized algorithms

@article{Bach1987RealisticAO,
  title={Realistic analysis of some randomized algorithms},
  author={E. Bach},
  journal={Proceedings of the nineteenth annual ACM symposium on Theory of computing},
  year={1987}
}
  • E. Bach
  • Published 1987
  • Computer Science, Mathematics
  • Proceedings of the nineteenth annual ACM symposium on Theory of computing
Many problems such as primality testing can be solved efficiently using a source of independent, identically distributed random numbers. It is therefore customary in the theory of algorithms to assume the availability of such a source. However, probabilistic algorithms often work well in practice with pseudo-random numbers; the point of this paper is to offer a justification for this fact. The results below apply to sequences generated by iteratively applying functions of the form ƒ (&khgr… Expand
Removing randomness from computational number theory
Primality testing with fewer random bits
Dispersers , Deterministic Ampli cation , and Weak RandomSources
Small-bias probability spaces: efficient constructions and applications
The Monte Carlo Algorithm With a Pseudorandom Generator
On randomization in sequential and distributed algorithms
On Generation of Probable Primes By Incremental Search
Factoring Polynomials Using Fewer Random Bits
...
1
2
3
4
5
...

References

SHOWING 1-3 OF 3 REFERENCES
Five number-theoretic algorithms
  • Proceedings of the Second Manitoba Conference on Numerical Mathematics,
  • 1972
Estimation de la fonction de Thebychef 0 sur le kieme nombre.premier et grandes valueurs de la fonction w(n), ;~rF;~de &viseurs de n
  • Acta Anthmettca
  • 1983