N. Stephens-Davidowitz

activity

20192022

most citedDimension-Preserving Reductions Between SVP and CVP in Different

p

-Norms

1 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.CC2020

On the Hardness of Average-case k-SUM

Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan

In this work, we show the first worst-case to average-case reduction for the classical $k$ -SUM problem. A $k$ -SUM instance is a collection of $m$ integers, and the goal of the $k$ -…

cs.DS2020

A $2^{n /2}$ -Time Algorithm for $n$ -SVP and $n$ -Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP

Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz

We show a $2^{n /2 + o (n)}$ -time algorithm that finds a (non-zero) vector in a lattice $L \subset R^{n}$ with norm at most $\tilde{O}(\sqrt{n})\cdot \min\{λ_1(\mathca…

On the Hardness of Average-case k-SUM

A 2n/2-Time Algorithm for n​-SVP and n​-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP

A $2^{n /2}$ -Time Algorithm for $n$ -SVP and $n$ -Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP