On the Complexity of Vector Searching
dc.citation.bibtexName | techreport | en_US |
dc.citation.issueNumber | 7807 | en_US |
dc.citation.journalTitle | Rice University ECE Technical Report | en_US |
dc.contributor.author | Hirschberg, D.S. | en_US |
dc.date.accessioned | 2007-10-31T00:47:05Z | |
dc.date.available | 2007-10-31T00:47:05Z | |
dc.date.issued | 1978-06-20 | |
dc.date.modified | 2003-10-23 | en_US |
dc.date.submitted | 2003-10-23 | en_US |
dc.description | Tech Report | en_US |
dc.description.abstract | The 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≥4k, k[log(n/k)] + 2k-1 comparisons are sufficient. | en_US |
dc.identifier.citation | D. Hirschberg, "On the Complexity of Vector Searching," <i>Rice University ECE Technical Report,</i> no. 7807, 1978. | |
dc.identifier.uri | https://hdl.handle.net/1911/19956 | |
dc.language.iso | eng | |
dc.subject | searching | * |
dc.subject | vector | * |
dc.subject | lower bounds | * |
dc.subject | complexity | * |
dc.subject.keyword | searching | en_US |
dc.subject.keyword | vector | en_US |
dc.subject.keyword | lower bounds | en_US |
dc.subject.keyword | complexity | en_US |
dc.title | On the Complexity of Vector Searching | en_US |
dc.type | Report | |
dc.type.dcmi | Text |
Files
Original bundle
1 - 1 of 1