(Gap/S)ETH hardness of SVP-Reference-Cited by-同舟云学术

(Gap/S)ETH hardness of SVP

Published:2018-06-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Aggarwal Divesh¹,Stephens-Davidowitz Noah²

Affiliation:

1. National University of Singapore, Singapore

2. Princeton University, USA

Funder

National Research Foundation Singapore

Singapore Ministry of Education

Publisher

ACM

Link

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

Reference68 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. Solving the Shortest Vector Problem in 2 n time via Discrete Gaussian Sampling. In STOC.

3. Divesh Aggarwal and Priyanka Mukhopadhyay. 2018. Faster algorithms for SVP and CVP in the ℓ ∞ norm. (2018). http://arxiv.org/abs/1801.02358. Divesh Aggarwal and Priyanka Mukhopadhyay. 2018. Faster algorithms for SVP and CVP in the ℓ ∞ norm. (2018). http://arxiv.org/abs/1801.02358.

4. Divesh Aggarwal and Noah Stephens-Davidowitz. 2018. (Gap/S)ETH Hardness of SVP. (2018). http://arxiv.org/abs/1712.00942. Divesh Aggarwal and Noah Stephens-Davidowitz. 2018. (Gap/S)ETH Hardness of SVP. (2018). http://arxiv.org/abs/1712.00942.

5. Divesh Aggarwal and Noah Stephens-Davidowitz. 2018. Just Take the Average! An Embarrassingly Simple 2 n -Time Algorithm for SVP (and CVP). In SOSA. Divesh Aggarwal and Noah Stephens-Davidowitz. 2018. Just Take the Average! An Embarrassingly Simple 2 n -Time Algorithm for SVP (and CVP). In SOSA.

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

1. Why we couldn’t prove SETH hardness of the Closest Vector Problem for even norms!;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Lattice Problems beyond Polynomial Time;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓ _p Norms;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Fine-Grained Hardness of Unique Shortest Vector Problem;2023

5. Approximate CVP in time 20.802;Journal of Computer and System Sciences;2022-03