Some results concerning efficient and optimal algorithms
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Bounds on the evaluation time for rational polynomial
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
| Hi-index | 0.00 |
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a polynomial and its derivative, a polynomial at two points, a polynomial of high degree using multiple precision arithmetic, and a bivariate polynomial of the form @Sa(i) x^iy^n^-^i are presented. Various ''coefficient splitting techniques'' are introduced in these algorithms and the optimality of certain techniques is shown.