Sciweavers

ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 5 months ago
Half-GCD and fast rational recovery
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
Daniel Lichtblau