Zeyong Li

activity

20202023

most citedDimension-Preserving Reductions Between SVP and CVP in Different

p

-Norms

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

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2023

The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs

Yi-Jun Chang, Zeyong Li

In this paper, we present a low-diameter decomposition algorithm in the LOCAL model of distributed computing that succeeds with probability $1 - 1/ p o l y (n)$ . Specifically, we show h…

cs.DS2021★ 1 cited

Dimension-Preserving Reductions Between SVP and CVP in Different $p$ -Norms

Divesh Aggarwal, Yanlin Chen, Rajendra Kumar +2

We show a number of reductions between the Shortest Vector Problem and the Closest…

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…

The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms

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

Dimension-Preserving Reductions Between SVP and CVP in Different $p$ -Norms

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