← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

11 第11章 散列表

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.688Z

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