Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Valérie Berthé / rank
 
Normal rank
Property / author
 
Property / author: Brigitte Vallée / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.aam.2013.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974936994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean algorithms are Gaussian / rank
 
Normal rank
Property / cites work
 
Property / cites work: On continued fraction expansions in positive characteristic: equivalence relations and some metric properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of steps in the Euclidean algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Estimate for the Number of Steps in the Euclidean Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presentation functions, fixed points, and a theory of scaling function dynamics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of continued fractions for polynomials over a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of steps in the Euclidean algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence rates in the central limit theorems for combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms with mediant convergents and their metrical theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact length of the Euclidean algorithm in [ <i>X</i> ] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian laws for the main parameters of the Euclid algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Euclidean algorithms for polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for $GF(q)[x]$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opérateurs de Ruelle-Mayer généralisés et analyse en moyenne des algorithmes d'Euclide et de Gauss / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical analysis of a class of Euclidean algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean dynamics / rank
 
Normal rank

Latest revision as of 12:04, 7 July 2024

scientific article
Language Label Description Also known as
English
Fine costs for Euclid's algorithm on polynomials and Farey maps
scientific article

    Statements

    Fine costs for Euclid's algorithm on polynomials and Farey maps (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2014
    0 references
    Laurent formal power series
    0 references
    finite field
    0 references
    continued fractions
    0 references
    Farey map
    0 references
    bit-complexity
    0 references
    cost function
    0 references
    combinatorial analysis
    0 references
    bivariate generating functions
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references