On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
Journal of the ACM (JACM)
The Calculation of Multivariate Polynomial Resultants
Journal of the ACM (JACM)
Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
The ALTRAN system for rational function manipulation - a survey
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Fast Algorithms for Manipulating Formal Power Series
Journal of the ACM (JACM)
A p-adic division with remainder algorithm
ACM SIGSAM Bulletin
Hi-index | 0.00 |
The problem of devising efficient algorithms for computing Q(x1,...,xr-1, P(x1,...,xr-1)) where P and Q are multivariate polynomials is considered. It is shown that for polynomials which are completely dense an algorithm based upon evaluation and interpolation is more efficient than Horner's method. Then various characterizations for sparse polynomials are made and the subsequent methods are re-analyzed. In conclusion a test is devised which takes only linear time to compute and by which a decision can automatically be made concerning whether to use a substitution algorithm which exploits sparsity or one which assumes relatively dense inputs. This choice yields the method which takes the fewest arithmetic operations.