Computation of powers of multivariate polynomialsover the integers
作者：
Highlights：
•
摘要
Theoretical computing time analyses of both the iterative multiplication and binaryexpansion algorithms for computing Pn for P∈I[x1,…,xr] show the iterative multiplication algorithm to be more efficient as r, the number of variables, increases.
论文关键词：
论文评审过程：Received 12 February 1971, Available online 31 December 2007.
论文官网地址：https://doi.org/10.1016/S0022-0000(72)80037-0
