On a parallel Lehmer-Euclid GCD algorithm
From MaRDI portal
Publication:2958950
DOI10.1145/384101.384142zbMath1356.68293OpenAlexW2022475297MaRDI QIDQ2958950
Publication date: 3 February 2017
Published in: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/384101.384142
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (3)
A modular reduction for GCD computation. ⋮ A randomized sublinear time parallel GCD algorithm for the EREW PRAM ⋮ A parallel extended GCD algorithm
This page was built for publication: On a parallel Lehmer-Euclid GCD algorithm