摘要
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.
出处
《自动化学报》
EI
CSCD
北大核心
2012年第7期1223-1224,共2页
Acta Automatica Sinica
关键词
定理
数模
哈希函数
卡普拉
字符集
计算
指纹
Data structures, data compression, Karp-Rabin fingerprints, hashing functions