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

Просмотр по теме "greatest common divisor"

Просмотр по теме "greatest common divisor"

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

  • An Effective Programming of GCD Algorithms for Natural Numbers 
    Al Halidi A.M.; Ishmukhametov S.T. (2020)
    © 2020, Allerton Press, Inc. We study the problem of acceleration of GCD algorithms for natural numbers based on the approximating k-ary algorithm. We suggest a new scheme of the approximating algorithm implementation ...
  • 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 ...

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

Просмотр

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