Using hard problems to create pseudorandom generators

Authors:
Noam Nisan
Affiliations:
Hebrew Univ., Jerusalem, Israel
Venue:
Using hard problems to create pseudorandom generators
Year:
1992

Citing 0
Cited 3

Reducing the complexity of reductions

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A new general derandomization method

Journal of the ACM (JACM)
Approximation Algorithms for Some Parameterized Counting Problems

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract