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