Now showing items 1-1 of 1

  • On the Complexity of Vector Searching 

    Hirschberg, D.S. (1978-06-20)
    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 ...