原书出处
Introduction to Algorithms, Fourth Edition
30 第30章 多项式与快速傅里叶变换
)-time algorithm to evaluate A(x0), A(x1), … , A(xn−1). 30-5 FFT using modular arithmetic
As defined, the discrete Fourier transform requires computation with complex numbers, which can result in a loss of precision due to round-off errors. For some problems, the answer is known to contain only integers, and a variant of the FFT based on modular arithmetic can guarantee that the answer is calculated exactly. An example of such a problem is that of multiplying two
polynomials with integer coefficients. Exercise 30.2-6 gives one approach, using a modulu
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea