Optimal algorithms for parallel polynomial evaluation
作者:
Highlights:
•
摘要
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmetic processors are presented. It is shown that, provided the degree of the polynomial to be evaluated exceeds k[log2k], an algorithm given is within one time unit of optimality.
论文关键词:
论文评审过程:Received 3 February 1972, Available online 27 December 2007.
论文官网地址:https://doi.org/10.1016/S0022-0000(73)80043-1