Some related functions to integer GCD and coprimality

DOI10.1016/J.ENDM.2011.05.024zbMATH Open1268.11162OpenAlexW2030656933MaRDI QIDQ2840696FDOQ2840696

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

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

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)

Cites Work

• Title not available (Why is that?)
• Two Fast GCD Algorithms
• Modern computer algebra
• Fast computation of continued fraction expansions.
• Title not available (Why is that?)
• An improved parallel algorithm for integer GCD
• A parallel extended GCD algorithm

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)