A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube (Q2819559)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube |
scientific article |
Statements
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube (English)
0 references
29 September 2016
0 references
