The Calculation of Multivariate Polynomial Resultants
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the genericity of the modular polynomial GCD algorithm
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
A fast Euclidean algorithm for Gaussian integers
Journal of Symbolic Computation
| Hi-index | 0.00 |
In this paper new algorithms are given for Gaussian integer division and the calculation of the greatest common divisor of two Gaussian integers. Empirical tests show that the new gcd algorithm is up to 5.39 times as fast as a Euclidean algorithm using the new division algorithm.