Optimal Multiplication Chains for Computing a Power of a Symbolic Polynomial

DOI10.2307/2005878zbMath0259.68019OpenAlexW4256104665MaRDI QIDQ5674974

W. M. Gentleman

Publication date: 1972

Full work available at URL: https://doi.org/10.2307/2005878

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (4)

Zero testing of algebraic functions ⋮ The efficient calculation of powers of polynomials ⋮ On the Computation of Powers of Sparse Polynomials ⋮ The Evaluation of Determinants by Expansion by Minors and the General Problem of Substitution

Cites Work

• Unnamed Item

This page was built for publication: Optimal Multiplication Chains for Computing a Power of a Symbolic Polynomial