Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (Q681960): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5317673
@@ Property / cites work: Q5317673 / rank @@
+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 @@
+An approximating \(k\)-ary GCD algorithm
@@ Property / cites work: An approximating \(k\)-ary GCD algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q5772619
@@ Property / cites work: Q5772619 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040797
@@ Property / cites work: Q4040797 / rank @@
+Normal rank
@@ Property / cites work @@
+Acceleration of Euclidean Algorithm and Rational Number Reconstruction
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.3103/s1066369x17110044
+Normal rank
@@ Property / OpenAlex ID @@
+W2766246451
@@ Property / OpenAlex ID: W2766246451 / rank @@
+Normal rank