原书出处
Introduction to Algorithms, Fourth Edition
C 附录C 计数与概率
s and the event that the other comes up heads are not independent. A collection A1, A2, …
, An of events is said to be pairwise independent if Pr {Ai ∩ Aj } = Pr {Ai} Pr {Aj} for all 1 ≤ i < j ≤ n. We say that the events of the collection
are (mutually) independent if every k-subset of the collection, where 2 ≤ k ≤ n and 1 ≤ i
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea