Optimal multiplication chains for computing a power of a symbolic polynomial

Authors:
W. Morven Gentleman
Affiliations:
University of Waterloo
Venue:
ACM SIGSAM Bulletin
Year:
1971

Citing 1
Cited 2

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries

ACM Transactions on Mathematical Software (TOMS)
Analysis of algorithms, a case study: Determinants of polynomials

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

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.