Two Fast Parallel GCD Algorithms of Many Integers

DOI10.1145/3087604.3087610zbMath1457.11172OpenAlexW2739019226MaRDI QIDQ5119967

Sidi Mohamed Sedjelmaci

Publication date: 9 September 2020

Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

parallel algorithmscomplexity analysisGCD of many integersparallel complexity of GCD

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computer solution of Diophantine equations (11Y50) Number-theoretic algorithms; complexity (11Y16)

Related Items (2)

Parallel complexity for nilpotent groups ⋮ Storage efficient algorithm for Hermite normal form using LLL

This page was built for publication: Two Fast Parallel GCD Algorithms of Many Integers