Algorithm and bound for the greatest common divisor of n integers

DOI10.1145/362686.362694zbMath0195.47201OpenAlexW1966466171MaRDI QIDQ5591939

Gordon H. Bradley

Publication date: 1970

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/362686.362694

zbMATH Keywords

computer science and automata

Related Items

A duality property for the set of all feasible solutions to an integer program, Semi-unification of two terms in Abelian groups, Factorization properties of lattices over the integers, A note on easy and efficient computation of full abelian periods of a word, On preprocessing for weighted MaxSAT, Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations, Computing GCD's by normalized division, Using the Blankinship algorithm to find the general solution of a linear diophantine equation, Transformation of integer programs to knapsack problems, Fine and Wilf's theorem for three periods and a generalization of Sturmian words, Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction, Complexity questions in number theory, A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix