Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov. A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube. In STOC. pages 305-311, 1999. [doi]
@inproceedings{ChakrabartiCGL99,
title = {A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube},
author = {Amit Chakrabarti and Bernard Chazelle and Benjamin Gum and Alexey Lvov},
year = {1999},
doi = {10.1145/301250.301325},
url = {http://doi.acm.org/10.1145/301250.301325},
researchr = {https://researchr.org/publication/ChakrabartiCGL99},
cites = {0},
citedby = {0},
pages = {305-311},
booktitle = {STOC},
}