The efficient calculation of powers of polynomials

DOI10.1016/S0022-0000(73)80003-0zbMath0277.65026MaRDI QIDQ1393926

Ellis Horowitz

Publication date: 1973

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Algorithms in computer science (68W99)

Related Items (2)

Computing representation matrices for the action of Frobenius on cohomology groups ⋮ On the Computation of Powers of Sparse Polynomials

Cites Work

• Unnamed Item
• Computation of powers of multivariate polynomials over the integers
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• The Calculation of Multivariate Polynomial Resultants
• Optimal Multiplication Chains for Computing a Power of a Symbolic Polynomial

This page was built for publication: The efficient calculation of powers of polynomials