TY - GEN
T1 - Near-optimal conversion of hardness into pseudo-randomness
AU - Impagliazzo, Russell
AU - Shaltiel, Ronen
AU - Wigderson, Avi
PY - 1999
Y1 - 1999
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/0033352910
U2 - 10.1109/sffcs.1999.814590
DO - 10.1109/sffcs.1999.814590
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0033352910
SN - 0769504094
T3 - Annual Symposium on Foundations of Computer Science - Proceedings
SP - 181
EP - 190
BT - 40th Annual Symposium on Foundations of Computer Science, FOCS 1999
PB - IEEE
T2 - 40th Annual Symposium on Foundations of Computer Science, FOCS 1999
Y2 - 17 October 1999 through 19 October 1999
ER -