GCD of random linear combinations

DOI10.1007/s00453-006-0072-1zbMath1100.68129OpenAlexW2070972726MaRDI QIDQ2509027

Igor E. Shparlinski, Joachim von zur Gathen

Publication date: 16 October 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-0072-1

zbMATH Keywords

probabilistic algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Randomized algorithms (68W20) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (3)

Probabilistic analyses of the plain multiple gcd algorithm ⋮ Fast arithmetics using Chinese remaindering ⋮ On the greatest common divisor of shifted sets

This page was built for publication: GCD of random linear combinations