GCD of Many Integers (Extended Abstract) [chapter]

Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas
1999 Lecture Notes in Computer Science  
A probabilistic algorithm is exhibited that calculates the gcd of many integers using gcds of pairs of integers; the expected number of pairwise gcds required is less than two.
doi:10.1007/3-540-48686-0_31 fatcat:dcyl7meamffe5mnhzz7a5fky5y