原书出处
Introduction to Algorithms, Fourth Edition
30 第30章 多项式与快速傅里叶变换
, use “complex (2n)th roots of unity,” which are denoted by the ω2n terms in Figure 30.1.
The following procedure takes advantage of the FFT to multiply two polynomials A(x) and B(x) of degree-bound n in Θ(n lg n)-time, where the input and output representations are in coefficient form. The procedure assumes that n is an exact power of 2, so if it isn’t, just add high-order zero coefficients. Double degree-bound: Create coefficient representations of A(x) and B(x) as degree-bound 2n
polynomials by adding n high-order zero coefficients to each. Evaluate: Compute point-val
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea