Aviad Rubinstein. Hardness of approximate nearest neighbor search. In Ilias Diakonikolas, David Kempe 0001, Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. pages 1260-1268, ACM, 2018. [doi]
@inproceedings{Rubinstein18,
title = {Hardness of approximate nearest neighbor search},
author = {Aviad Rubinstein},
year = {2018},
doi = {10.1145/3188745.3188916},
url = {http://doi.acm.org/10.1145/3188745.3188916},
researchr = {https://researchr.org/publication/Rubinstein18},
cites = {0},
citedby = {0},
pages = {1260-1268},
booktitle = {Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018},
editor = {Ilias Diakonikolas and David Kempe 0001 and Monika Henzinger},
publisher = {ACM},
}