Now showing items 1-1 of 1

    • Pseudorandom Generators without the XOR Lemma 

      Trevisan, Luca; Sudan, Madhu; Vadhan, Salil P.; sudan (Elsevier, 2001)
      Impagliazzo and Wigderson have recently shown that if there exists a decision problem solvable in time 2^{O(n)} and having circuit complexity 2^{Omega(n)} (for all but finitely many n) then P=BPP. This result is a culmination ...