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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.