Computation of powers of multivariate polynomialsover the integers

https://doi.org/10.1016/S0022-0000(72)80037-0Get rights and content
Under an Elsevier user license
open archive

Theoretical computing time analyses of both the iterative multiplication and binaryexpansion algorithms for computing Pn for PI[x1,…,xr] show the iterative multiplication algorithm to be more efficient as r, the number of variables, increases.

Cited by (0)

*

Current address: Bell Telephone Laboratories, Inc., Holmdel, NJ 07733.