On the Quantitative Hardness of CVP

Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz. On the Quantitative Hardness of CVP. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. pages 13-24, IEEE Computer Society, 2017. [doi]

@inproceedings{BennettGS17,
  title = {On the Quantitative Hardness of CVP},
  author = {Huck Bennett and Alexander Golovnev and Noah Stephens-Davidowitz},
  year = {2017},
  doi = {10.1109/FOCS.2017.11},
  url = {https://doi.org/10.1109/FOCS.2017.11},
  researchr = {https://researchr.org/publication/BennettGS17},
  cites = {0},
  citedby = {0},
  pages = {13-24},
  booktitle = {58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017},
  editor = {Chris Umans},
  publisher = {IEEE Computer Society},
  isbn = {978-1-5386-3464-6},
}