The Computational Complexity of Universal Hashing.
Yishay MansourNoam NisanPrasoon TiwariPublished in: Computational Complexity Conference (1990)
Keyphrases
- computational complexity
- np complete
- high computational complexity
- special case
- decision problems
- hash functions
- computational cost
- np hard
- low complexity
- storage requirements
- data sets
- data structure
- computationally efficient
- file organization
- locality sensitive hashing
- random projections
- memory requirements
- nearest neighbor search
- bit rate
- similarity search
- machine learning
- computational efficiency
- explanatory power
- linear hashing
- linear computational complexity
- computational load
- exhaustive search
- database
- rate distortion
- artificial intelligence
- information retrieval
- real time