Organization of computer systems: the fixed plus variable structure computer
IRE-AIEE-ACM '60 (Western) Papers presented at the May 3-5, 1960, western joint IRE-AIEE-ACM computer conference
Generalizations of Horner's rule for polynomial evaluation
IBM Journal of Research and Development
New algorithms and lower bounds for the parallel evaluation of certain rational expressions
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Binary Trees and Parallel Scheduling Algorithms
IEEE Transactions on Computers
Square-rich fixed point polynomial evaluation on FPGAs
Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arrays
| Hi-index | 0.00 |
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[log"2k], an algorithm given is within one time unit of optimality.