论文信息 - The Computing Time of the Euclidean Algorithm

The Computing Time of the Euclidean Algorithm

The maximum, minimum and average computing times of the classical Euclidean algorithm for the greatest common divisor of two integers are derived, to within codominance, as functions of the lengths of the two inputs and the output.

George E. Collins

[1] W. S. Brown,et al. On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors , 1971, JACM.

[2] George E. Collins,et al. The Calculation of Multivariate Polynomial Resultants , 1971, JACM.

[3] D. Musser. Algorithms for polynomial factorization. , 1971 .

[4] G. E. Collins. Computing time analyses for some arithmetic and algebraic algorithms , 1969 .

[5] J. Dixon. The number of steps in the Euclidean algorithm , 1970 .