Pseudo-Random Generators and Structure of Complete Degrees

  • Authors:

  • Manindra Agrawal

  • Affiliations:

  • -

  • Venue:
  • CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is shown that if there exist sets in E that require 2^{\Omega(n)}-sized circuits then sets that are hard for class P, and above, under 1-1 reductions are also hard under 1-1, size-increasing 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 many-one reductions are also hard under (non-uniform) 1-1, and size-increasing reductions.