TY - JOUR
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 - http://www.scopus.com/inward/record.url?scp=0033352910&partnerID=8YFLogxK
U2 - 10.1109/sffcs.1999.814590
DO - 10.1109/sffcs.1999.814590
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0033352910
SN - 0272-5428
SP - 181
EP - 190
JO - Annual Symposium on Foundations of Computer Science - Proceedings
JF - Annual Symposium on Foundations of Computer Science - Proceedings
T2 - Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science
Y2 - 17 October 1999 through 19 October 1999
ER -