The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The efficient calculation of powers of polynomials
Journal of Computer and System Sciences
Sparse polynomial powering using heaps
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
| Hi-index | 0.00 |
Theoretical computing time analyses of both the iterative multiplication and binaryexpansion algorithms for computing P^n for P@?I[x"1,...,x"r] show the iterative multiplication algorithm to be more efficient as r, the number of variables, increases.