Login / Signup
How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O.
Aayush Jain
Huijia Lin
Christian Matt
Amit Sahai
Published in:
EUROCRYPT (1) (2019)
Keyphrases
</>
input output
special case
phase transition
computational complexity
np complete
file system
multiscale
optimal solution
upper bound
multi dimensional
information theoretic
constraint satisfaction
uniform distribution
garbage collection