"A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching ..."

Amit Chakrabarti et al. (1999)

> Home

Details and statistics

DOI: 10.1145/301250.301325

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/ChakrabartiCGL99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/ChakrabartiCGL99
Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov:
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube. STOC 1999: 305-311

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.