Optimal multiplication chains for computing a power of a symbolic polynomial
W. Morven Gentleman · Mathematics of Computation · 1972
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.