Higher Lower Bounds for Near-Neighbor and Further Rich Problems

DOI10.1137/070684859zbMath1200.68081OpenAlexW2063284471WikidataQ60638765 ScholiaQ60638765MaRDI QIDQ3558020

Mihai Pǎtraşcu, Mikkel Thorup

Publication date: 29 April 2010

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070684859

zbMATH Keywords

data structureslower boundsnearest neighborcell-probe complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (1)

Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality?

This page was built for publication: Higher Lower Bounds for Near-Neighbor and Further Rich Problems