Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2008.04.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006804687 / rank
 
Normal rank

Revision as of 03:39, 20 March 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
    0 references
    0 references
    0 references
    0 references
    0 references
    18 June 2009
    0 references
    0 references
    0 references
    0 references
    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