3 ms·
Perfect hashing provably has size that is O(n) in the data being indexed. You can think of this as approximate perfect hashing. You trade off a bit of accuracy
by noelwelsh 9y ago
Perfect hashing provably has size that is O(n) in the data being indexed. You can think of this as approximate perfect hashing. You trade off a bit of accuracy for a lot of compression.
- eternalban 9y agoThanks. That [is] what I gathered as well. My OP was merely to note relevant existing results.