Optimal algorithms for parallel polynomi
โ
Ian Munro; Michael Paterson
๐
Article
๐
1973
๐
Elsevier Science
๐
English
โ 363 KB
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[Iog2 k], an algorithm given is within one time unit of optimality.