Computational Complexity
All rolling hash functions are linear in the number of characters, but their complexity with respect to the length of the window varies. Rabin-Karp rolling hash requires the multiplications of two -bit numbers, integer multiplication is in . Hashing ngrams by cyclic polynomials can be done in linear time.
Read more about this topic: Rolling Hash
Famous quotes containing the word complexity:
“The price we pay for the complexity of life is too high. When you think of all the effort you have to put in—telephonic, technological and relational—to alter even the slightest bit of behaviour in this strange world we call social life, you are left pining for the straightforwardness of primitive peoples and their physical work.”
—Jean Baudrillard (b. 1929)
Related Phrases
Related Words