Computation of exponential modula when using hashing functions such as Karp-Rabin fingerprints can be quite cumbersome especially when the alphabet size is large. In this paper, we show an interesting result which can...Computation of exponential modula when using hashing functions such as Karp-Rabin fingerprints can be quite cumbersome especially when the alphabet size is large. In this paper, we show an interesting result which can allow this computation to be done in a very simple and efficient manner.展开更多
文摘Computation of exponential modula when using hashing functions such as Karp-Rabin fingerprints can be quite cumbersome especially when the alphabet size is large. In this paper, we show an interesting result which can allow this computation to be done in a very simple and efficient manner.
