Cargando…
A primer on pseudorandom generators
A fresh look at the question of randomness was taken in the theory of computing: A distribution is pseudorandom if it cannot be distinguished from the uniform distribution by any efficient procedure. This paradigm, originally associating efficient procedures with polynomial-time algorithms, has been...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
American Mathematical Society
2010
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2623055 |