Pseudorandom generators without the XOR Lemma

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 537-546

  Sudan, Madhu ^a   Trevisan, Luca ^a   Vadhan, Salil ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTION; RANDOM PROCESSES; THEOREM PROVING;

PSEUDORANDOM GENERATORS;

COMPUTATIONAL COMPLEXITY;

EID: 0032686554     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (43)