Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:07, 30 January 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
