Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms |
scientific article; zbMATH DE number 5566485
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms |
scientific article; zbMATH DE number 5566485 |
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
