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

Author(s):  
Amit Chakrabarti ◽  
Bernard Chazelle ◽  
Benjamin Gum ◽  
Alexey Lvov
Sign in / Sign up

Export Citation Format

Share Document