← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

C 附录C 计数与概率

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

for any α > 0, the function eαx strictly increases in x, where we will determine α later.

Using Markov’s inequality (C.34), we obtain The bulk of the proof consists of bounding E[eα(X−μ)] and substituting a suitable value for α in inequality (C.48). First, we evaluate E[

eα(X−μ)]. Using the technique of indicator random variables (see Section 5.2), let Xi = I

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea