Nearly Optimal Pseudorandomness From Hardness.

Dean Doron Dana Moshkovitz Justin Oh David Zuckerman

Published in: Electron. Colloquium Comput. Complex. (2019)

Keyphrases

worst case
optimal solution
dynamic programming
database
databases
multiscale
computational complexity
real time
website
data structure
np hard
mobile robot
globally optimal
optimal design
asymptotically optimal