Login / Signup
Nearly Optimal Pseudorandomness from Hardness.
Dean Doron
Dana Moshkovitz
Justin Oh
David Zuckerman
Published in:
J. ACM (2022)
Keyphrases
</>
worst case
optimal solution
asymptotically optimal
globally optimal
dynamic programming
computer vision
feature selection
website
case study
similarity measure
bayesian networks
data structure
lower bound
learning algorithm
real world
np complete
learning theory
optimal control
databases
optimal design
database