The complexity of greatest common divisor computations

Bohdan S. Majewski, George Havas. The complexity of greatest common divisor computations. In Leonard M. Adleman, Ming-Deh A. Huang, editors, Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings. Volume 877 of Lecture Notes in Computer Science, pages 184-193, Springer, 1994.

Abstract

Abstract is missing.