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

Просмотр по автору "Amer I.F."

Просмотр по автору "Amer I.F."

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

  • Amer I.F.; Alkhalidi A.M.; Ishmukhametov S.T. (2020)
    © 2020 SERSC. In our paper we analyze effectiveness of several algorithms of the GCD calculation for pairs of large naturals with respect to their speed, number of iterations and possibility of parallelization of the ...
  • 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 ...
  • Amer I.F.; Mohammed H.N. (2020)
    © Published under licence by IOP Publishing Ltd. In our paper, we investigate some implementations of an approximating k-ary GCD algorithm (AKA) for calculating the greatest common divisor of natural numbers for given A ...
  • Amer I.F.; Ishmukhametov S.T.; Alkhalidi A.M. (2021)
    In our paper, we consider the procedure for effective programming of an approximating k-ary GCD algorithm of natural numbers in the C++ programming language in the Visual Studio programming environment with the installed ...
  • Amer I.F.; Saad M. (2020)
    © Published under licence by IOP Publishing Ltd. In our paper, we consider some approaches to accelerating the calculation of the Greatest Common Divisor (GCD) of natural numbers for given A and B based on the k-ary GCD ...

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

Просмотр

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