%0 Journal Article
%T The Exponential Modulus Theorem<br>指数模定理(英文)
%A RAJPOOT Nasir
%A <br>RAJPOOT
%A Nasir
%J 自动化学报
%D 2012
%I 
%X 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 com-putation to be done in a very simple and efficient manner.
%K Data structures
%K data compression
%K Karp-Rabin fingerprints
%K hashing functions<br>Data
%K structures
%K data
%K compression
%K Karp-Rabin
%K fingerprints
%K hashing
%K functions
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=E76622685B64B2AA896A7F777B64EB3A&aid=BC10CD3F59E055E22CCFB80B1891977C&yid=99E9153A83D4CB11&vid=16D8618C6164A3ED&iid=DF92D298D3FF1E6E&sid=7C786AA9670CF26C&eid=3819B8B7C1B72552&journal_id=0254-4156&journal_name=自动化学报&referenced_num=0&reference_num=7