On a new algorithm for computing GCD of integer numbers
<p>In the paper we give an introduction to a new algorithm counting the greatest common divisor (GCD) of natural integers called the approximating GCD algorithm introduced by S.Ishmukhametov in 2016. We compare it with the classical Euclidean GCD algorithm and the kary GCD algorithm in spirit...
में बचाया:
| मुख्य लेखकों: | , , , |
|---|---|
| स्वरूप: | पुस्तक |
| प्रकाशित: |
Trends in Computer Science and Information Technology - Peertechz Publications,
2020-07-06.
|
| विषय: | |
| ऑनलाइन पहुंच: | Connect to this object online. |
| टैग: |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|
MARC
| LEADER | 00000 am a22000003u 4500 | ||
|---|---|---|---|
| 001 | peertech__10_17352_tcsit_000013 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a ST Ishmukhametov |e author |
| 700 | 1 | 0 | |a BG Mubarakov |e author |
| 700 | 1 | 0 | |a RG Rubtsova |e author |
| 700 | 1 | 0 | |a Al Khalidi Arkan Mohammed |e author |
| 245 | 0 | 0 | |a On a new algorithm for computing GCD of integer numbers |
| 260 | |b Trends in Computer Science and Information Technology - Peertechz Publications, |c 2020-07-06. | ||
| 520 | |a <p>In the paper we give an introduction to a new algorithm counting the greatest common divisor (GCD) of natural integers called the approximating GCD algorithm introduced by S.Ishmukhametov in 2016. We compare it with the classical Euclidean GCD algorithm and the kary GCD algorithm in spirit of J. Sorenson and K. Weber and outline their advantages and disadvantages. </p> | ||
| 540 | |a Copyright © ST Ishmukhametov et al. | ||
| 546 | |a en | ||
| 655 | 7 | |a Short Communication |2 local | |
| 856 | 4 | 1 | |u https://doi.org/10.17352/tcsit.000013 |z Connect to this object online. |