原书出处
Introduction to Algorithms, Fourth Edition
30 第30章 多项式与快速傅里叶变换
e, this chapter concentrates on efficient algorithms for them. Point-value representation
A point-value representation of a polynomial A(x) of degree-bound n is a set of n point-value pairs {(x0, y0), (x1, y1),
… , (xn−1, yn−1)} such that all of the xk are distinct and for k = 0, 1, … , n − 1. A pol
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea