Timeline for What is an example of a weakly universal hash function that is not pairwise independent?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2019 at 18:58 | comment | added | Yuval Filmus | I don’t see any lookup tables in your question. Perhaps you need to spend more time formulating your question. When you have a concrete follow-up question, you can ask it separately. | |
| Feb 14, 2019 at 18:55 | comment | added | Simd | Actually I am confused. How can we map all other elements of the universe uniformly and independently in practice? It feels like you would need to store a vast lookup table. Is that what you had in mind? | |
| Feb 14, 2019 at 17:24 | vote | accept | Simd | ||
| Feb 14, 2019 at 17:24 | comment | added | Yuval Filmus | Well, it makes a nice exercise. | |
| Feb 14, 2019 at 17:20 | comment | added | Simd | Thank you. With your additional comment this is perfect. It does make you wonder why this is not taught in algorithms classes. | |
| Feb 14, 2019 at 17:19 | history | edited | Yuval Filmus | CC BY-SA 4.0 |
added 225 characters in body
|
| Feb 14, 2019 at 17:15 | comment | added | Yuval Filmus | See if you like the new answer... | |
| Feb 14, 2019 at 17:15 | history | edited | Yuval Filmus | CC BY-SA 4.0 |
added 225 characters in body
|
| Feb 14, 2019 at 17:13 | comment | added | Simd | No I don’t think so. Thank you for your very nice answer to the first version. | |
| Feb 14, 2019 at 17:12 | comment | added | Yuval Filmus | Is there anything else you forgot about the question? I don't like continuously changing my answer to fit an ever-changing question. | |
| Feb 14, 2019 at 17:07 | comment | added | Simd | Oh sorry. I meant $|U|$ to be larger than $m$? Let me fix that. | |
| Feb 14, 2019 at 16:59 | history | answered | Yuval Filmus | CC BY-SA 4.0 |