On the Computation of Powers of Sparse Polynomials

DOI10.1002/sapm1974532145zbMath0327.65040OpenAlexW2528130235MaRDI QIDQ4092871

Richard J. Fateman

Publication date: 1974

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sapm1974532145

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Roundoff error (65G50) Numerical computation of solutions to single equations (65H05)

Related Items (1)

Parallel multiplication and powering of polynomials

Uses Software

• MACSYMA

Cites Work

• The efficient calculation of powers of polynomials
• Computation of powers of multivariate polynomials over the integers
• Optimal Multiplication Chains for Computing a Power of a Symbolic Polynomial

This page was built for publication: On the Computation of Powers of Sparse Polynomials