The Computational Complexity of Universal Hashing.
Yishay MansourNoam NisanPrasoon TiwariPublished in: Theor. Comput. Sci. (1993)
Keyphrases
- computational complexity
- np complete
- special case
- nearest neighbor search
- np hard
- order preserving
- high computational complexity
- linear hashing
- hash tables
- low complexity
- hashing algorithm
- lower bound
- computational cost
- computational load
- hash functions
- decision problems
- similarity search
- data structure
- data mining
- exhaustive search
- storage requirements
- random projections
- computationally efficient
- bit rate
- motion estimation
- high dimensional
- video sequences
- gray code
- sequence prediction
- information retrieval