← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

11 第11章 散列表

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

s for a and p values for b, the family Hpm contains p(p − 1) hash functions. Theorem 11.4

The family Hpm of hash functions defined by equations (11.3) and (11.4) is universal.

Proof Consider two distinct keys k1 and k2 from ℤp, so that k1 ≠ k2. For a given hash fun

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea