Extractors and pseudo-random generators with optimal seed length

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 1-10

  Impagliazzo, Russell ^a   Shaltiel, Ronen ^b   Wigderson, Avi ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

KOLMOGOROV COMPLEXITY THEORY; PSEUDO-RANDOM GENERATORS; SUB-POLYNOMIAL ENTROPY LEVELS;

RANDOM NUMBER GENERATION;

EID: 0033692219     PISSN: 07349025     EISSN: None     Source Type: None    
DOI: 10.1145/335305.335306     Document Type: Conference Paper

References (23)