P = BPP if E requires exponential circuits: Derandomizing the XOR lemma

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 220-229

  Impagliazzo, Russell ^a   Wigderson, Avi ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LOGIC GATES; PROBABILITY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

PROBABILISTIC ALGORITHMS;

BOOLEAN FUNCTIONS;

EID: 0030706544     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)