Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jsc.2008.04.018 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JSC.2008.04.018 / rank | |||
Normal rank | |||
Latest revision as of 13:33, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms |
scientific article |
Statements
Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (English)
0 references
18 June 2009
0 references
Euclid algorithm
0 references
divide and conquer algorithms
0 references
fast multiplication
0 references
analysis of algorithms
0 references
transfer operators
0 references
Perron formula
0 references
0 references
0 references
