dandf2012's blog

By dandf2012, history, 6 years ago, In English

Normally when we do string hashing, we use values 1...26. Can we do such a hash for values 1...N where N is 50000? I think it is maybe more error, but is there some bound on N for which we can safely use polynomial hash?

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
6 years ago, # |
  Vote: I like it +3 Vote: I do not like it

From what I have read about hashing, I think the hash should be working fine for large N(=50000) as well.

A good link for this is : Zlobober's comment in Anti-Hash test discussion, where he mentions about distribution of hash value to be nearly a uniform-distribution over the field. I remember once using it for large values, and still getting Accepted. The key is using multiple hashes.