<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2016-03-06 16:06:05Information retrieval Search algorithms Information science Hashing Cryptographic hash functions Error detection and correction Hash function Hash table Universal hashing Locality-sensitive hashing |
Add to Reading List |
Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define
