Results 1 -
2 of
2
The Unified Theory of Pseudorandomness
, 2007
"... We survey the close connections between a variety of “pseudorandom objects,” namely pseudorandom generators, expander graphs, list-decodable error-correcting codes, randomness extractors, averaging samplers, and hardness amplifiers. ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
We survey the close connections between a variety of “pseudorandom objects,” namely pseudorandom generators, expander graphs, list-decodable error-correcting codes, randomness extractors, averaging samplers, and hardness amplifiers.
The Computational Complexity Column
"... this article mention all of the amazing research in computational complexity theory. We survey various areas in complexity choosing papers more for their historical value than necessarily the importance of the results. We hope that this gives an insight into the richness and depth of this still quit ..."
Abstract
- Add to MetaCart
this article mention all of the amazing research in computational complexity theory. We survey various areas in complexity choosing papers more for their historical value than necessarily the importance of the results. We hope that this gives an insight into the richness and depth of this still quite young eld
