原书出处
Introduction to Algorithms, Fourth Edition
30 第30章 多项式与快速傅里叶变换
ursive calls, each invocation takes Θ(n) time, where n is the length of the input vector.
The recurrence for the running time is therefore T(n) = 2T(n/2) + Θ(n) = Θ(n lg n), by case 2 of the master theorem (Theorem 4.1). Thus the FFT can evaluate a polynomial of degree-bound n at the complex nth roots of unity in Θ(n lg n) time. Interpolation at the complex roots of unity The polynomial multiplication scheme entails
converting from coefficient form to point-value form by evaluating the polynomial at the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea