A strong lower bound for approximate nearest neighbor searching
type: Item
instance of: scholarly article
title: A strong lower bound for approximate nearest neighbor searching
zbMATH Open document ID: 1173.68468
author: Ding Liu
published in: Information Processing Letters
publication date: 2009-08-27T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5599128
zbMATH Keywords: computational geometry
zbMATH Keywords: approximate nearest neighbor searching
zbMATH Keywords: lower bound
MaRDI profile type: Publication
full work available at URL: j.ipl.2004.06.001
OpenAlex ID: W1975663164
cites work: Q3140429
cites work: Q3128920
cites work: Tighter bounds for nearest neighbor search and related problems in the cell probe model
cites work: Lower bounds for high dimensional nearest neighbor search and related problems
cites work: A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
cites work: Approximate nearest neighbor queries revisited
cites work: Q4515159
cites work: A Randomized Algorithm for Closest-Point Queries
cites work: Nearest neighbor pattern classification
cites work: Q4749022
cites work: Multidimensional Searching Problems
cites work: Q3772828
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: Q4542583
cites work: Q4527027
cites work: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
cites work: Lower bounds for union-split-find related problems on random access machines
cites work: On data structures and asymmetric communication complexity
cites work: Should Tables Be Sorted?
DOI: 10.1016/J.IPL.2004.06.001
description: scientific article; zbMATH DE number 5599128