Issue No. 01 - January (1973 vol. 22)
K. Maruyama , Department of Computer Science, University of Illinois
If an unlimited number of processors is available, then for any given number of steps s, s=1, polynomials of degree as large as C2<sup>n-d</sup>can be evaluated, where C= v2 and d ? v2s. This implies polynomials of degree can be evaluated in log<inf>2</inf>n+v2log<inf>2</inf>n +0(1) steps. Various techniques for the evaluation of polynomials in a "reasonable number" of "steps" are compared with th
Parallel algorithms, polynomial evaluation.
K. Maruyama, "On the Parallel Evaluation of Polynomials", IEEE Transactions on Computers, vol. 22, no. , pp. 2-5, January 1973, doi:10.1109/T-C.1973.223593