Rolling Hash - Computational Complexity

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:

    “It is not only their own need to mother that takes some women by surprise; there is also the shock of discovering the complexity of alternative child-care arrangements that have been made to sound so simple. Those for whom the intended solution is equal parenting have found that some parents are more equal than others.”
    —Elaine Heffner (20th century)