An approximating \(k\)-ary GCD algorithm (Q2361674): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The number of steps in the Euclidean algorithm
@@ Property / cites work: The number of steps in the Euclidean algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Fast computation of continued fraction expansions.
+Normal rank
@@ Property / cites work @@
+On practical aspects of the Miller-Rabin primality test
+Normal rank
@@ Property / cites work @@
+Two Fast GCD Algorithms
@@ Property / cites work: Two Fast GCD Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The accelerated integer GCD algorithm
@@ Property / cites work: The accelerated integer GCD algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234183
@@ Property / cites work: Q4234183 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5772619
@@ Property / cites work: Q5772619 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s1995080216060147
+Normal rank
@@ Property / OpenAlex ID @@
+W2555912531
@@ Property / OpenAlex ID: W2555912531 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2361674