A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube

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]

Abstract

Abstract is missing.