原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
k2) is at most ϵ. Therefore, a universal family of hash functions is also 1/m-universal.2
The family H is d-independent if for any distinct keys k1, k2,
…, kd in U and any slots q1, q2, …, qd, not necessarily distinct, in {0, 1, …, m − 1} the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea