Some related functions to integer GCD and coprimality

DOI10.1016/J.ENDM.2011.05.024MaRDI QIDQ2840696zbMATH OpenOpenAlexFDO

Authors Sidi Mohamed Sedjelmaci

Publication date 23 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2011.05.024

zbMATH Keywords

algorithmsparallel complexitygreatest common divisor (GCD)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Two fast parallel GCD algorithms of many integers
• A modular integer GCD algorithm
• An improved parallel algorithm for integer GCD
• On a parallel Lehmer-Euclid GCD algorithm
• Algorithms and Computation

Cites work

• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• scientific article; zbMATH DE number 2137052 (Why is no real title available?)
• A parallel extended GCD algorithm
• An improved parallel algorithm for integer GCD
• Fast computation of continued fraction expansions.
• Modern computer algebra
• Two Fast GCD Algorithms

This page was built for publication: Some related functions to integer GCD and coprimality

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