The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1989)
Research Triangle Park, NC, USA
Oct. 30, 1989 to Nov. 1, 1989
ISBN: 0-8186-1982-1
pp: 242-247
A.V. Goldberg , Dept. of Comput. Sci., Stanford Univ., CA, USA
M. Kharitonov , Dept. of Comput. Sci., Stanford Univ., CA, USA
ABSTRACT
Computational resources necessary to generate pseudorandom strings are studied. In particular, lower bounds are proved for pseudorandom number generators, whereas previous research concentrated on upper bounds. The idea of separation of machine-based complexity classes on the basis of their ability (or inability) to generate pseudorandom strings is introduced and investigated.
INDEX TERMS
machine-based complexity, pseudorandom number generators, lower bounds
CITATION
A.V. Goldberg, M. Yung, M. Kharitonov, "Lower bounds for pseudorandom number generators", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 242-247, 1989, doi:10.1109/SFCS.1989.63485
95 ms
(Ver 3.3 (11022016))