Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls

Thomas Holenstein, Makrand Sinha. Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012. pages 698-707, IEEE Computer Society, 2012. [doi]

Authors

Thomas Holenstein

This author has not been identified. Look up 'Thomas Holenstein' in Google

Makrand Sinha

This author has not been identified. Look up 'Makrand Sinha' in Google