research
∙
08/12/2023
An Efficient Quantum Factoring Algorithm
We show that n-bit integers can be factorized by independently running a...
share
research
∙
05/30/2020
New bounds on the density of lattice coverings
We obtain new upper bounds on the minimal density of lattice coverings o...
research
∙
05/19/2020
Continuous LWE
We introduce a continuous analogue of the Learning with Errors (LWE) pro...
research
∙
06/11/2018
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors
We show that unless ⊆ (2^(n)), there is no polynomial-time algorithm a...
research
∙
06/11/2018
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy
In 1991, Papadimitriou and Yannakakis gave a reduction implying the -h...
research
∙
10/31/2017
