Kazan Federal University Digital Repository

Browsing Научные публикации в Scopus by Subject "k-ary GCD algorithm"

Browsing Научные публикации в Scopus by Subject "k-ary GCD algorithm"

Sort by: Order: Results:

  • Ishmukhametov S.; Mubarakov B.; Maad K. (2017)
    © 2017, Allerton Press, Inc. Bezout’s equation is a representation of the greatest common divisor d of integers A and B as a linear combination Ax + By = d, where x and y are integers called Bezout’s coefficients. The task ...
  • Amer I.F.; Ishmukhametov S.T. (2020)
    © 2020 IEEE. In our paper we investigate the k-ary Algorithm for finding GCD of long natural numbers. We suggest an effective modification for the Algorithm which gives an essential acceleration for the whole procedure of ...

Search DSpace


Advanced Search

Browse

My Account