Optimal algorithms for parallel polynomial evaluation
Ian Munro, Michael Stewart Paterson · 1971
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.