Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Munro et al. (1971) studied this question.