Электронный архив

Просмотр по теме "k-ary GCD algorithm"

Просмотр по теме "k-ary GCD algorithm"

Отсортировать по:Сортировать:Результаты поиска на странице:

  • Analysis of the k-ary Euclid for tuples of integers 
    Ishmukhametov Shamil Talgatovich; Amer Ismail (2019)
    In our paper we discuss the k-ary Euclid Algorithm for counting the great common divisor (GCD) of two or more integers and suggest some improvements. This gives us a possibility to parallelize and speed up the calculating ...
  • Calculation of Bezout’s coefficients for the k-ary algorithm of finding GCD 
    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 ...
  • Investigation of the k-ary GCD Algorithm for Natural Numbers 
    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 ...

Поиск в электронном архиве

Просмотр

Моя учетная запись