On the Complexity of Vector Searching

Simple item page
dc.citation.bibtexNametechreporten_US
dc.citation.issueNumber7807en_US
dc.citation.journalTitleRice University ECE Technical Reporten_US
dc.contributor.authorHirschberg, D.S.en_US
dc.date.accessioned2007-10-31T00:47:05Z
dc.date.available2007-10-31T00:47:05Z
dc.date.issued1978-06-20
dc.date.modified2003-10-23en_US
dc.date.submitted2003-10-23en_US
dc.descriptionTech Reporten_US
dc.description.abstractThe 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.citationD. Hirschberg, "On the Complexity of Vector Searching," <i>Rice University ECE Technical Report,</i> no. 7807, 1978.
dc.identifier.urihttps://hdl.handle.net/1911/19956
dc.language.isoeng
dc.subjectsearching*
dc.subjectvector*
dc.subjectlower bounds*
dc.subjectcomplexity*
dc.subject.keywordsearchingen_US
dc.subject.keywordvectoren_US
dc.subject.keywordlower boundsen_US
dc.subject.keywordcomplexityen_US
dc.titleOn the Complexity of Vector Searchingen_US
dc.typeReport
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Hir1978Jun9OntheComp.PDF
Size:
507.42 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications