A lower bound for integer greatest common divisor computations. (English) Zbl 0819.11066
MSC:
11Y16 | Number-theoretic algorithms; complexity |
68Q25 | Analysis of algorithms and problem complexity |
11A05 | Multiplicative structure; Euclidean algorithm; greatest common divisors |