KFU. Card publication. A fast algorithm for counting GCD of natural numbers

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

A FAST ALGORITHM FOR COUNTING GCD OF NATURAL NUMBERS

Form of presentation

Conference proceedings in Russian journals and collections

Year of publication

2016

Язык

русский

Authors, employees of KFU

Ishmukhametov Shamil Talgatovich, author

Rubcova Ramilya Gakilevna, author

Bibliographic description in the original language

S.T.Ishmukhametov, R.G.Rubtsova. A fast algorithm for counting GCD of natural numbers, tezisy dokladov mezhdunarodnoy konferencii «Algebra, analiz i geometriya«, Kazan, KFU, 2016, s.52-53

Annotation

Алгебра, анализ и геометрия

Keywords

Наибольший общий делитель, k-арный алгоритм

The name of the journal

Алгебра, анализ и геометрия

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

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

Full metadata record

Field DC	Value	Language
dc.contributor.author	Ishmukhametov Shamil Talgatovich	ru_RU
dc.contributor.author	Rubcova Ramilya Gakilevna	ru_RU
dc.date.accessioned	2016-01-01T00:00:00Z	ru_RU
dc.date.available	2016-01-01T00:00:00Z	ru_RU
dc.date.issued	2016	ru_RU
dc.identifier.citation	S.T.Ishmukhametov, R.G.Rubtsova. A fast algorithm for counting GCD of natural numbers, тезисы докладов международной конференции «Алгебра, анализ и геометрия«, Казань, КФУ, 2016, с.52-53	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=138928&p_lang=2	ru_RU
dc.description.abstract	Алгебра, анализ и геометрия	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	Наибольший общий делитель	ru_RU
dc.subject	k-арный алгоритм	ru_RU
dc.title	A fast algorithm for counting GCD of natural numbers	ru_RU
dc.type	Conference proceedings in Russian journals and collections	ru_RU