The Computation of Powers of Symbolic Polynomials
Ellis Horowitz, Sartaj K. Sahni · SIAM Journal on Computing · 1975
Recent results on the computation of powers of symbolic polynomials are reviewed in perspective. Then a new algorithm is given which computes the nth power of a completely sparse polynomial using a linear number of multiplications. This is followed by experimental results comparing the new algorithm to iteration using both completely sparse and completely dense polynomials as data.