Near-optimal conversion of hardness into pseudo-randomness

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 181-190

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

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

CIRCUIT COMPLEXITY; NW GENERATOR; PROBABILISTIC ALGORITHMS;

RANDOM PROCESSES;

EID: 0033352910     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sffcs.1999.814590     Document Type: Conference Paper

References (12)