Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube
STOC, 1999.
@inproceedings{STOC-1999-ChakrabartiCGL,
author = "Amit Chakrabarti and Bernard Chazelle and Benjamin Gum and Alexey Lvov",
booktitle = "{Proceedings of the 31st Annual ACM Symposium on Theory of Computing}",
doi = "10.1145/301250.301325",
isbn = "1-58113-067-8",
pages = "305--311",
publisher = "{ACM}",
title = "{A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube}",
year = 1999,
}











