Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm
type: Item
instance of: scholarly article
title: Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm
zbMATH Open document ID: 1412.11143
DOI: 10.3103/S1066369X17110044
author: Sh. T. Ishmukhametov
author: B. G. Mubarakov
author: Kamal' Al'-Anni Maad
published in: Russian Mathematics
publication date: 2018-02-13T00:00:00Z
Mathematics Subject Classification ID: 11Y16
zbMATH DE Number: 6837707
zbMATH Keywords: Euclidean algorithm
zbMATH Keywords: extended Euclidean algorithm
zbMATH Keywords: \(k\)-ary GCD algorithm
zbMATH Keywords: calculation of inverse elements by module
MaRDI profile type: Publication
cites work: Q5317673
cites work: Two Fast GCD Algorithms
cites work: The accelerated integer GCD algorithm
cites work: Q4234183
cites work: An approximating \(k\)-ary GCD algorithm
cites work: Q5772619
cites work: Q4040797
cites work: Acceleration of Euclidean Algorithm and Rational Number Reconstruction
full work available at URL: s1066369x17110044
OpenAlex ID: W2766246451
description: scientific article; zbMATH DE number 6837707