Login / Signup
Nearly Optimal Pseudorandomness From Hardness.
Dean Doron
Dana Moshkovitz
Justin Oh
David Zuckerman
Published in:
FOCS (2020)
Keyphrases
</>
worst case
dynamic programming
finding optimal
expert systems
closed form
evolutionary algorithm
computational complexity
search engine
information retrieval
optimal solution
data sets
multiscale
three dimensional
decision trees
constraint satisfaction
optimal strategy
asymptotically optimal