This work addresses the question of hardness versus randomness trade-offs. By using the NW-generator in a new, more sophisticated way, derandomization in almost optimal time using any lower bound s(n) is obtained. Following Trevisan, information theoretic analogs of the new construction are explored.
|Number of pages||10|
|Journal||Annual Symposium on Foundations of Computer Science - Proceedings|
|State||Published - 1999|
|Event||Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science - New York, NY, USA|
Duration: 17 Oct 1999 → 19 Oct 1999
ASJC Scopus subject areas
- Hardware and Architecture