Highly Influenced

# The black-box complexity of nearest-neighbor search

@article{Krauthgamer2005TheBC, title={The black-box complexity of nearest-neighbor search}, author={Robert Krauthgamer and James R. Lee}, journal={Theor. Comput. Sci.}, year={2005}, volume={348}, pages={262-276} }

- Published 2005 in Theor. Comput. Sci.
DOI:10.1016/j.tcs.2005.09.017

We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answers (1 + ε)-ANN queries in polylog(n) time using only polynomial space. We then study which families of metric spaces admit efficient ANN schemes in the black-box model, where only oracle access to the distance function is given, and any query consistent with the triangle inequality may be asked. For ε < 5 , we offer a… CONTINUE READING

Highly Cited

This paper has 58 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 59 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**59**citations based on the available data.See our **FAQ** for additional information.