Is the Euclidean Algorithm Optimal Among its Peers? (Q4678946): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.2178/bsl/1102022663 / rank | |||
| Property / cites work | |||
| Property / cites work: Generating the greatest common divisor, and limitations of primitive recursive algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On primitive recursive algorithms and the greatest common divisor function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound for integer greatest common divisor computations / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.2178/BSL/1102022663 / rank | |||
Normal rank | |||
Latest revision as of 15:03, 30 December 2024
scientific article; zbMATH DE number 2171381
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Is the Euclidean Algorithm Optimal Among its Peers? |
scientific article; zbMATH DE number 2171381 |
Statements
Is the Euclidean Algorithm Optimal Among its Peers? (English)
0 references
24 May 2005
0 references
greatest common divisor
0 references
Euclidean algorithm
0 references
recursive program
0 references
