activity
20152019
most citedJust Take the Average! An Embarrassingly Simple -Time Algorithm for SVP (and CVP)

4 citations · 6 across the 6 of their papers we have counts for

collaborators

8 papers

cs.CC2019★ 1 cited

Fine-grained hardness of CVP(P) -- Everything that we can prove (and nothing else)

Divesh Aggarwal, Huck Bennett, Alexander Golovnev +1

We show a number of fine-grained hardness results for the Closest Vector Problem in the norm (), and its approximate and non-uniform variants. First, we sh…

cs.DS2019

Slide Reduction, Revisited---Filling the Gaps in SVP Approximation

Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen +1

We show how to generalize Gama and Nguyen's slide reduction algorithm [STOC '08] for solving the approximate Shortest Vector Problem over lattices (SVP). As a result, we show the f…

cs.DS2019★ 1 cited

A time-distance trade-off for GDD with preprocessing---Instantiating the DLW heuristic

Noah Stephens-Davidowitz

For , we show an algorithm that does the following. Given appropriate preprocessing consisting of vectors in som…

cs.DS2017★ 4 cited

Just Take the Average! An Embarrassingly Simple -Time Algorithm for SVP (and CVP)

Divesh Aggarwal, Noah Stephens-Davidowitz

We show a -time (and space) algorithm for the Shortest Vector Problem on lattices (SVP) that works by repeatedly running an embarrassingly simple "pair and average" sie…

cs.CC2017

On the Quantitative Hardness of CVP

Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz

$ \newcommand{\eps}{\varepsilon} \newcommand{\problem}[1]{\ensuremath{\mathrm{#1}} } \newcommand{\CVP}{\problem{CVP}} \newcommand{\SVP}{\problem{SVP}} \newcommand{\CVPP}{\problem{C…

math.MG2016

A Reverse Minkowski Theorem

Oded Regev, Noah Stephens-Davidowitz

$ \newcommand{\R}{\mathbb{R}} \newcommand{\lat}{\mathcal{L}} $We prove a conjecture due to Dadush, showing that if $\lat \subset \R^n$ is a lattice such that $\det(\lat') \ge 1$ fo…

cs.DS2016

On the Lattice Distortion Problem

Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz

We introduce and study the \emph{Lattice Distortion Problem} (LDP). LDP asks how "similar" two lattices are. I.e., what is the minimal distortion of a linear bijection between the…

cs.CC2015

Discrete Gaussian Sampling Reduces to CVP and SVP

Noah Stephens-Davidowitz

The discrete Gaussian is the distribution that assigns to each vector in a shifted lattice probability proportional to . It has long be…