A Caltech Library Service

Pseudo-Random Generators for All Hardnesses

Umans, Christopher (2002) Pseudo-Random Generators for All Hardnesses. In: 17th Annual Conference on Computational Complexity. Annual IEEE Conference on Computational Complexity. IEEE , Los Alamitos, CA, p. 7. ISBN 0-7695-1468-5.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


A pseudo-random generator (PRG) is a function that “stretches” a short random seed into a longer pseudo-random output string that “fools” small circuits.

Item Type:Book Section
Related URLs:
Additional Information:© 2002 IEEE. Date of Current Version: 07 August 2002. The conference version of this abstract appears in the Proceedings of STOC 2002, May 19–21, 2002, Montreal, Quebec, Canada.
Series Name:Annual IEEE Conference on Computational Complexity
Record Number:CaltechAUTHORS:20111110-081820059
Persistent URL:
Official Citation:Umans, C.; , "Pseudo-random generators for all hardnesses," Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on , vol., no., pp.7, 2002 doi: 10.1109/CCC.2002.1004326 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:27725
Deposited By: Ruth Sustaita
Deposited On:10 Nov 2011 17:24
Last Modified:09 Nov 2021 16:51

Repository Staff Only: item control page