Nearly Optimal Pseudorandomness From Hardness

Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman. Nearly Optimal Pseudorandomness From Hardness. Electronic Colloquium on Computational Complexity (ECCC), 26:99, 2019. [doi]

Abstract

Abstract is missing.