We show that n-bit integers can be factorized by independently running a...
We obtain new upper bounds on the minimal density of lattice coverings o...
We introduce a continuous analogue of the Learning with Errors (LWE) pro...
We show
that unless ⊆ (2^(n)), there is no
polynomial-time algorithm a...
In 1991, Papadimitriou and Yannakakis gave a reduction implying the
-h...
We consider the problem of efficiently learning mixtures of a large numb...