Pseudorandom generators without the XOR Lemma
[Extended Abstract]
z x
Madhu Sudany Luca Trevisan Salil Vadhan
Abstract Intro duction
Impagliazzo and Wigderson [IW97] have recently shown that if This paper continues the exploration of hardness versus random-
O n
there exists a decision problem solvable in time and hav- ness trade-offs, that is, results showing that randomized algorithms
n