On the Complexity of Searching a Set of Vectors

DOI10.1137/0209012zbMath0446.68046OpenAlexW2063170522MaRDI QIDQ3891774

Daniel S. Hirschberg

Publication date: 1980

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

Full work available at URL: https://semanticscholar.org/paper/fa2b927053f852977d1956898a7ce8f0003d2317

zbMATH Keywords

lower boundsvector searching problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (2)

A quick tour on suffix arrays and compressed suffix arrays ⋮ Supporting random access in files of variable length records

This page was built for publication: On the Complexity of Searching a Set of Vectors