Hirschberg, D.S.2007-10-312007-10-311978-06-202003-10-23D. Hirschberg, "On the Complexity of Vector Searching," <i>Rice University ECE Technical Report,</i> no. 7807, 1978.https://hdl.handle.net/1911/19956Tech ReportThe vector searching problem is, given k-vector A (a k-vector) is a vector that has k components, over the integers) and given a set B of n distinct k-vectors, to determine whether or not A is a member of set B. Comparisons between components yielding "greater than-equal-less than" results are permitted. It is shown that if the vectors in B are unordered then nk comparisons are necessary and sufficient. In the case when the vectors in B are ordered, it is shown that [log n] + k comparisons are necessary and, for n&#8805;4k, k[log(n/k)] + 2k-1 comparisons are sufficient.engsearchingvectorlower boundscomplexityReportsearchingvectorlower boundscomplexity