Two fast parallel GCD algorithms of many integers

DOI10.1145/3087604.3087610MaRDI QIDQ5119967zbMATH OpenOpenAlexFDO

Authors 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

complexity analysisGCD of many integersparallel algorithmsparallel complexity of GCD

Mathematics Subject Classification ID

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

Recommendations

• An improved parallel algorithm for integer GCD
• A parallel extended GCD algorithm
• On a parallel Lehmer-Euclid GCD algorithm
• Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
• A modular integer GCD algorithm

Cited in

(15)

• A parallel extended GCD algorithm
• An effective programming of GCD algorithms for natural numbers
• Storage efficient algorithm for Hermite normal form using LLL
• An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling
• Some related functions to integer GCD and coprimality
• On a parallel Lehmer-Euclid GCD algorithm
• scientific article; zbMATH DE number 4152522 (Why is no real title available?)
• Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
• scientific article; zbMATH DE number 1186932 (Why is no real title available?)
• Fast computation of GCDs
• scientific article; zbMATH DE number 1736309 (Why is no real title available?)
• scientific article; zbMATH DE number 742957 (Why is no real title available?)
• Parallel complexity for nilpotent groups
• An improved parallel algorithm for integer GCD
• A randomized sublinear time parallel GCD algorithm for the EREW PRAM

This page was built for publication: Two fast parallel GCD algorithms of many integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119967)