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. 305-311 1999 STOC http://doi.acm.org/10.1145/301250.301325 db/conf/stoc/stoc1999.html#ChakrabartiCGL99