Pseudo-Random Generators and Structure of Complete Degrees

@inproceedings{Agrawal2002PseudoRandomGA,
  title={Pseudo-Random Generators and Structure of Complete Degrees},
  author={Manindra Agrawal},
  booktitle={IEEE Conference on Computational Complexity},
  year={2002}
}
It is shown that if there exist sets in E that require -sized circuits then sets that are hard for class P, and above, under 1-1 reductions are also hard under 1-1, sizeincreasing reductions. Under the assumption of the hardness of solving RSA or Discrete Log problem, it is shown that sets that are hard for class NP, and above, under manyone reductions are also hard under (non-uniform) 1-1, and size-increasing reductions. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
24 Extracted Citations
21 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 21 references

Wigderson . Hardness vs . randomness

  • A.
  • J . Comput . Sys . Sci .
  • 1999

BPP if E requires exponential circuits : Derandomizing the XOR lemma

  • � A.Wigderson.P
  • SIAM Journal on Computing
  • 1998

Similar Papers

Loading similar papers…