A case study in comparison based complexity: Finding the nearest value(s)

DOI10.1007/BFB0028244MaRDI QIDQ4037402zbMATH OpenFDO

Authors Walter Cunto, J. Ian Munro, Patricio V. Poblete

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028244

zbMATH Keywords

average case complexitynearest valueselection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Finding Nearest Larger Neighbors
• scientific article; zbMATH DE number 1445326
• Expected-Case Complexity of Approximate Nearest Neighbor Searching
• The complexity of comparing optimal solutions
• The black-box complexity of nearest-neighbor search
• The complexity of finding fixed-radius near neighbors
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1226332
• A note on the best-case complexity

This page was built for publication: A case study in comparison based complexity: Finding the nearest value(s)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037402)