On approximating the covering radius and finding dense lattice subspaces-Reference-Cited by-同舟云学术

On approximating the covering radius and finding dense lattice subspaces

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Dadush Daniel¹

Affiliation:

1. CWI, Netherlands

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3313276.3316397

Reference41 articles.

1. Divesh Aggarwal Daniel Dadush Oded Regev and Noah Stephens-Davidowitz. 2015. Divesh Aggarwal Daniel Dadush Oded Regev and Noah Stephens-Davidowitz. 2015.

2. Solving the Shortest Vector Problem in 2 n Time via Discrete Gaussian Sampling. In STOC. Available at http://arxiv.org/abs/1412.7994. Solving the Shortest Vector Problem in 2 n Time via Discrete Gaussian Sampling. In STOC. Available at http://arxiv.org/abs/1412.7994.

3. Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!

4. Miklós Ajtai Ravi Kumar and D. Sivakumar. 2001. A Sieve Algorithm for the Shortest Lattice Vector Problem. In STOC. 601–610. 380752.380857 10.1145/380752.380857 Miklós Ajtai Ravi Kumar and D. Sivakumar. 2001. A Sieve Algorithm for the Shortest Lattice Vector Problem. In STOC. 601–610. 380752.380857 10.1145/380752.380857

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems;Journal of Global Optimization;2024-03-20

2. A reverse Minkowski theorem;Annals of Mathematics;2024-01-01

3. The Subspace Flatness Conjecture and Faster Integer Programming;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06