Is the Euclidean Algorithm Optimal Among its Peers? (Q4678946): Difference between revisions

@@ Property / DOI @@
-.2178/bsl/1102022663
@@ Property / DOI: 10.2178/bsl/1102022663 / rank @@
-Normal rank
@@ Property / author @@
-L. P. D. van den Dries
@@ Property / author: L. P. D. van den Dries / rank @@
-Normal rank
@@ Property / author @@
+L. P. D. van den Dries
@@ Property / author: L. P. D. van den Dries / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2178/bsl/1102022663
+Normal rank
@@ Property / OpenAlex ID @@
+W2137695078
@@ Property / OpenAlex ID: W2137695078 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating the greatest common divisor, and limitations of primitive recursive algorithms
+Normal rank
@@ Property / cites work @@
+On primitive recursive algorithms and the greatest common divisor function
+Normal rank
@@ Property / cites work @@
+A lower bound for integer greatest common divisor computations
+Normal rank
@@ Property / DOI @@
+.2178/BSL/1102022663
@@ Property / DOI: 10.2178/BSL/1102022663 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4678946