原书出处
Introduction to Algorithms, Fourth Edition
30 第30章 多项式与快速傅里叶变换
f polynomials, since it guarantees that the recursive subproblems are only half as large.
Lemma 30.6 (Summation lemma) For any integer n ≥ 1 and nonzero integer k not divisible by n, Proof Equation (A.6) on page 1142 applies to complex values as well as to reals, giving
To see that the denominator is not 0, note that only when k is divisible by n, which the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea