Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz. Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 1816-1835, SIAM, 2022. [doi]
@inproceedings{AggarwalBGS22,
title = {Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)},
author = {Divesh Aggarwal and Huck Bennett and Alexander Golovnev and Noah Stephens-Davidowitz},
year = {2022},
doi = {10.1137/1.9781611976465.109},
url = {https://doi.org/10.1137/1.9781611976465.109},
researchr = {https://researchr.org/publication/AggarwalBGS22},
cites = {0},
citedby = {0},
pages = {1816-1835},
booktitle = {Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022},
editor = {Joseph (Seffi) Naor and Niv Buchbinder},
publisher = {SIAM},
isbn = {978-1-61197-707-3},
}