Optimal Multiplication Chains for Computing a Power of a Symbolic Polynomial
- 1 October 1972
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 26 (120) , 935-939
- https://doi.org/10.2307/2005878
Abstract
This paper shows that in a certain model of symbolic manipulation of algebraic formulae, the simple method of computing a power of a symbolic polynomial by repeated multiplication by the original polynomial is, in essence, the optimal method.Keywords
This publication has 0 references indexed in Scilit: