A Greatest Common Divisor Algorithm
From MaRDI portal
Publication:4704559
DOI10.1142/S0218196798000296zbMath0962.11003MaRDI QIDQ4704559
Ari Belenkiy, Raimundas Vidunas
Publication date: 20 June 2001
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Cites Work
This page was built for publication: A Greatest Common Divisor Algorithm