research
∙
11/21/2022
Lattice Problems Beyond Polynomial Time
We study the complexity of lattice problems in a world where algorithms,...
share
research
∙
04/14/2021
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms
We show a number of reductions between the Shortest Vector Problem and t...
research
∙
10/17/2020
On the Hardness of Average-case k-SUM
In this work, we show the first worst-case to average-case reduction for...
research
∙
07/19/2020
A 2^n/2-Time Algorithm for √(n)-SVP and √(n)-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP
We show a 2^n/2+o(n)-time algorithm that finds a (non-zero) vector in a ...
research
∙
11/06/2019
Fine-grained hardness of CVP(P)— Everything that we can prove (and nothing else)
We show that the Closest Vector Problem in the â„“_p norm (CVP_p) cannot b...
research
∙
08/10/2019
Slide Reduction, Revisited---Filling the Gaps in SVP Approximation
We show how to generalize Gama and Nguyen's slide reduction algorithm [S...
research
∙
02/22/2019
A time-distance trade-off for GDD with preprocessing---Instantiating the DLW heuristic
For 0 ≤α≤ 1/2, we show an algorithm that does the following. Given appro...
research
∙
12/04/2017
