Suchergebnisse - "Binary GCD algorithm"

On Acceleration of the k-ary GCD Algorithm

Autoren: Amer I. Ishmukhametov S.

Quelle: Учёные записки Казанского университета: Серия Физико-математические науки, Vol 161, Iss 1, Pp 110-118 (2019)
SCOPUS25417746-2019-161-1-SID85071981073

Schlagwörter: binary gcd algorithm, euclidian gcd algorithm, Euclidian GCD algorithm, greatest common divisor for natural numbers, K-ary GCD algorithm, QA1-939, Binary GCD algorithm, Greatest common divisor for natural numbers, Mathematics, k-ary gcd algorithm

Zugangs-URL: https://doaj.org/article/52eeec2e44064236878b486603fc9ac2
https://openrepository.ru/article?id=198656

Existence of a limiting distribution for the binary GCD algorithm

Autoren: Gérard Maze

Quelle: Journal of Discrete Algorithms. 5:176-186

Schlagwörter: Binary gcd algorithm, Fixed point, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Functional Analysis (math.FA), 68W40, 68Q25, 47H10, Mathematics - Functional Analysis, Computational Theory and Mathematics, General Mathematics (math.GM), 0103 physical sciences, FOS: Mathematics, Discrete Mathematics and Combinatorics, Analysis of algorithms, Mathematics - General Mathematics

Zugangs-URL: http://arxiv.org/abs/math/0504426
https://dblp.uni-trier.de/db/journals/jda/jda5.html#Maze07
https://core.ac.uk/display/82094294
https://www.sciencedirect.com/science/article/pii/S157086670600027X
http://user.math.uzh.ch/maze/Articles/BrentArxiv.pdf

Analysis of a left-shift binary GCD algorithm

Autoren: Shallit, Jeffrey Sorenson, Jonathan

Quelle: Lecture Notes in Computer Science ISBN: 9783540586913

Schlagwörter: Computational Mathematics, Algebra and Number Theory, Theory and Algorithms, binary GCD algorithm, Analysis of algorithms and problem complexity, Number Theory, Multiplicative structure, Euclidean algorithm, greatest common divisors, 0102 computer and information sciences, 0101 mathematics, complexity, 01 natural sciences, Number-theoretic algorithms

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0747717184710303
https://digitalcommons.butler.edu/facsch_papers/1339/
https://dblp.uni-trier.de/db/journals/jsc/jsc17.html#ShallitS94
https://core.ac.uk/display/82485981
https://www.sciencedirect.com/science/article/abs/pii/S0747717184710303
https://link.springer.com/chapter/10.1007/3-540-58691-1_55
https://rd.springer.com/chapter/10.1007%2F3-540-58691-1_55
https://link.springer.com/content/pdf/10.1007%2F3-540-58691-1_55.pdf
https://dblp.uni-trier.de/db/conf/ants/ants1994.html#ShallitS94

Modulo q greatest common divisor algorithms

Autoren: Szabó, Sándor

Schlagwörter: binary gcd algorithm, extended gcd algorithm, 11A05, 11Y16

Relation: https://hdl.handle.net/10525/5874

Verfügbarkeit: https://hdl.handle.net/10525/5874

On acceleration of the k-ary GCD algorithm

Autoren: Amer I. Ishmukhametov S.

Quelle: SCOPUS25417746-2019-161-1-SID85071981073

Index Begriffe: Binary GCD algorithm, Euclidian GCD algorithm, Greatest common divisor for natural numbers, K-ary GCD algorithm, Article

URL: http://hdl.handle.net/rour/198656uri
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki
1
161
110