Login / Signup

On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions.

Judy GoldsmithLane A. HemachandraKenneth Kunen
Published in: FSTTCS (1991)
Keyphrases
  • minimal perfect hash functions
  • computational complexity
  • data sets
  • feature selection
  • data analysis
  • pattern recognition
  • data streams
  • nearest neighbor
  • worst case
  • space complexity
  • order preserving