Key points are not available for this paper at this time.
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 klog2k, an algorithm given is within one time unit of optimality.
Munro et al. (1971) studied this question.