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?
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?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3650 |
2 | Benq | 3582 |
3 | Geothermal | 3570 |
3 | orzdevinwang | 3570 |
5 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3532 |
8 | Radewoosh | 3522 |
9 | Um_nik | 3483 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
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.