Three new algorithms for multivariate polynomial GCD
Journal of Symbolic Computation
A p-adic division with remainder algorithm
ACM SIGSAM Bulletin
Hi-index | 0.00 |
Let A, B, and Q be multivariate polynomials satisfying A = QB. Given A and B, we can calculate Q by recursive multivariate power-series division. In this division some higher degree terms of A and B are not needed at all. A simple and useful degree bound for the significant terms of A and B is derived here.