KFU. Card publication. On a new algorithm for computing GCD of integer numbers

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

ON A NEW ALGORITHM FOR COMPUTING GCD OF INTEGER NUMBERS

Form of presentation

Conference proceedings in international journals and collections

Year of publication

2020

Язык

английский

Authors, employees of KFU

Al-Khalidi Arkan Mokhammed Ali, author

Ishmukhametov Shamil Talgatovich, author

Mubarakov Bulat Gazinurovich, author

Rubcova Ramilya Gakilevna, author

Bibliographic description in the original language

ST Ishmukhametov, BG Mubarakov, RG Rubtsova and Al Khalidi Arkan Mohammed. On a new algorithm for computing GCD of integer numbers // Trends in Computer Science and Information Technology

Annotation

Trends in Computer Science and Information Technology

Keywords

greatest common divisor, fast algorithms

The name of the journal

Trends in Computer Science and Information Technology

URL

https://www.peertechz.com/journals/trends-in-computer-science-and-information-technology

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=284449&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Al-Khalidi Arkan Mokhammed Ali	ru_RU
dc.contributor.author	Ishmukhametov Shamil Talgatovich	ru_RU
dc.contributor.author	Mubarakov Bulat Gazinurovich	ru_RU
dc.contributor.author	Rubcova Ramilya Gakilevna	ru_RU
dc.date.accessioned	2020-01-01T00:00:00Z	ru_RU
dc.date.available	2020-01-01T00:00:00Z	ru_RU
dc.date.issued	2020	ru_RU
dc.identifier.citation	ST Ishmukhametov, BG Mubarakov, RG Rubtsova and Al Khalidi Arkan Mohammed. On a new algorithm for computing GCD of integer numbers // Trends in Computer Science and Information Technology	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=284449&p_lang=2	ru_RU
dc.description.abstract	Trends in Computer Science and Information Technology	ru_RU
dc.description.abstract	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.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	greatest common divisor	ru_RU
dc.subject	fast algorithms	ru_RU
dc.title	On a new algorithm for computing GCD of integer numbers	ru_RU
dc.type	Conference proceedings in international journals and collections	ru_RU