Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Thue–Morse sequence
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Hash collisions === The initial {{math|2<sup>''k''</sup>}} bits of the Thue–Morse sequence are mapped to 0 by a wide class of polynomial [[hash function]]s modulo a [[power of two]], which can lead to [[hash collision]]s.<ref>{{cite journal |last1=Pachocki |first1=Jakub |last2=Radoszewski |first2=Jakub |title=Where to Use and How not to Use Polynomial String Hashing |journal=Olympiads in Informatics |date=2013 |volume=7 |pages=90–100 |url=https://ioinformatics.org/journal/INFOL119.pdf}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)