Subquadratic divide-and-conquer algorithms for computing the greatest common divisor have been studied for a couple of decades. The integer case has been notoriously difficult, with the need for "backup steps" in various forms. This paper explains why backup steps are necessary for algorithms based directly on the quotient sequence, and proposes a robustness criterion that can be used to construct a "half-gcd" algorithm without any backup steps. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Möller, N. (2006). Robust HGCD with no backup steps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4151 LNCS, pp. 194–204). Springer Verlag. https://doi.org/10.1007/11832225_17
Mendeley helps you to discover research relevant for your work.