Zeyong Li

activity

20202022

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

4 papers

cs.CC2022★ 1 cited

Lattice Problems Beyond Polynomial Time

Divesh Aggarwal, Huck Bennett, Zvika Brakerski +6

We study the complexity of lattice problems in a world where algorithms, reductions, and protocols can run in superpolynomial time, revisiting four foundational results: two worst-…

cs.CC2022

A Computation Model with Automatic Functions and Relations as Primitive Operations

Ziyuan Gao, Sanjay Jain, Li Zeyong +2

Prior work of Hartmanis and Simon (Hartmanis and Simon, 1974) and Floyd and Knuth (Floyd and Knuth, 1990) investigated what happens if a device uses primitive steps more natural th…

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…

Lattice Problems Beyond Polynomial Time

A Computation Model with Automatic Functions and Relations as Primitive Operations

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