Constant-Error Pseudorandomness Proofs from Hardness Require Majority.

Published in: ACM Trans. Comput. Theory (2019)

Keyphrases

error rate
computational complexity
error bounds
phase transition
learning theory
lower bound
np complete
real time
data sets
databases
social networks
image sequences
multiscale
objective function
formal proof