Fine-grained hardness of CVP(P)— Everything that we can prove (and nothing else). Aggarwal, D., Bennett, H., Golovnev, A., & Stephens-Davidowitz, N. In *SODA*, 2021. Paper Simons blog post bibtex 19 downloads @inproceedings{ABGSFinegrainedHardness19,
title = {Fine-grained hardness of {{CVP}}({{P}})--- {{Everything}} that we can prove (and nothing else)},
url = {http://arxiv.org/abs/1911.02440},
author = {Aggarwal, Divesh and Bennett, Huck and Golovnev, Alexander and {Stephens-Davidowitz}, Noah},
year = {2021},
booktitle = {SODA},
url_Simons_blog_post = {https://blog.simons.berkeley.edu/2020/05/fine-grained-hardness-of-lattice-problems-open-questions/},
}

Downloads: 19

{"_id":"sGJW6pmbAZDSDfmB4","bibbaseid":"aggarwal-bennett-golovnev-stephensdavidowitz-finegrainedhardnessofcvppeverythingthatwecanproveandnothingelse-2021","author_short":["Aggarwal, D.","Bennett, H.","Golovnev, A.","Stephens-Davidowitz, N."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Fine-grained hardness of CVP(P)— Everything that we can prove (and nothing else)","url":"http://arxiv.org/abs/1911.02440","author":[{"propositions":[],"lastnames":["Aggarwal"],"firstnames":["Divesh"],"suffixes":[]},{"propositions":[],"lastnames":["Bennett"],"firstnames":["Huck"],"suffixes":[]},{"propositions":[],"lastnames":["Golovnev"],"firstnames":["Alexander"],"suffixes":[]},{"propositions":[],"lastnames":["Stephens-Davidowitz"],"firstnames":["Noah"],"suffixes":[]}],"year":"2021","booktitle":"SODA","url_simons_blog_post":"https://blog.simons.berkeley.edu/2020/05/fine-grained-hardness-of-lattice-problems-open-questions/","bibtex":"@inproceedings{ABGSFinegrainedHardness19,\n\ttitle = {Fine-grained hardness of {{CVP}}({{P}})--- {{Everything}} that we can prove (and nothing else)},\n\turl = {http://arxiv.org/abs/1911.02440},\n\tauthor = {Aggarwal, Divesh and Bennett, Huck and Golovnev, Alexander and {Stephens-Davidowitz}, Noah},\n\tyear = {2021},\n\tbooktitle = {SODA},\n\turl_Simons_blog_post = {https://blog.simons.berkeley.edu/2020/05/fine-grained-hardness-of-lattice-problems-open-questions/},\n}\n\n","author_short":["Aggarwal, D.","Bennett, H.","Golovnev, A.","Stephens-Davidowitz, N."],"key":"ABGSFinegrainedHardness19","id":"ABGSFinegrainedHardness19","bibbaseid":"aggarwal-bennett-golovnev-stephensdavidowitz-finegrainedhardnessofcvppeverythingthatwecanproveandnothingelse-2021","role":"author","urls":{"Paper":"http://arxiv.org/abs/1911.02440"," simons blog post":"https://blog.simons.berkeley.edu/2020/05/fine-grained-hardness-of-lattice-problems-open-questions/"},"metadata":{"authorlinks":{}},"downloads":19},"bibtype":"inproceedings","biburl":"https://dl.dropbox.com/s/26018h26wgh5c2o/bibbase.bib","dataSources":["bNuEGB6D6ArYKZG7X","rNfpY7KpfzEnPHFDu","mb294T8RPmLcqf4vP","j49aoDnSSLjzndmof","BNGEiq2enqS7mhAQ9","L5symwsFtugce8mTM"],"keywords":[],"search_terms":["fine","grained","hardness","cvp","everything","prove","nothing","aggarwal","bennett","golovnev","stephens-davidowitz"],"title":"Fine-grained hardness of CVP(P)— Everything that we can prove (and nothing else)","year":2021,"downloads":19}