An extended Jebelean^ WeberNSedjelmaci GCD algorithm

DOI10.22405/2226-8383-2018-19-2-421-431zbMath1434.11235OpenAlexW4243380651MaRDI QIDQ5109663

Dmitry A. Dolgov

Publication date: 13 May 2020

Published in: Chebyshevskii sbornik (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/cheb664

zbMATH Keywords

GCD\(k\)-ary GCDbinary GCDEuclidean GCDLehmer GCDSchönhage GCDWeber GCD

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm
• Jebelean-Weber's algorithm without spurious factors
• Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes
• Polynomial greatest common divisor as a solution of system of linear equations
• MDS codes in Doob graphs
• GCD calculation in the search task of pseudoprime and strong pseudoprime numbers
• Computational problems associated with Racah algebra
• Fast computation of continued fraction expansions.
• Two Fast GCD Algorithms
• The accelerated integer GCD algorithm
• Algorithmic Number Theory
• Euclid's Algorithm for Large Numbers

This page was built for publication: An extended Jebelean^ WeberNSedjelmaci GCD algorithm