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

From MaRDI portal
Added link to MaRDI item.
Import recommendations run Q6767936
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aam.2013.11.001 / rank
Normal rank
 
Property / author
 
Property / author: Valérie Berthé / rank
Normal rank
 
Property / author
 
Property / author: Brigitte Vallée / rank
Normal rank
 
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: Publication / 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
Property / DOI
 
Property / DOI: 10.1016/J.AAM.2013.11.001 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Analysis of Euclidean algorithms for polynomials over finite fields / rank
 
Normal rank
Property / Recommended article: Analysis of Euclidean algorithms for polynomials over finite fields / qualifier
 
Similarity Score: 0.8792014
Amount0.8792014
Unit1
Property / Recommended article: Analysis of Euclidean algorithms for polynomials over finite fields / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q2843908 / rank
 
Normal rank
Property / Recommended article: Q2843908 / qualifier
 
Similarity Score: 0.86922413
Amount0.86922413
Unit1
Property / Recommended article: Q2843908 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4502655 / rank
 
Normal rank
Property / Recommended article: Q4502655 / qualifier
 
Similarity Score: 0.8639144
Amount0.8639144
Unit1
Property / Recommended article: Q4502655 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field / rank
 
Normal rank
Property / Recommended article: Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field / qualifier
 
Similarity Score: 0.8616122
Amount0.8616122
Unit1
Property / Recommended article: Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the cost of computing roots of polynomials / rank
 
Normal rank
Property / Recommended article: On the cost of computing roots of polynomials / qualifier
 
Similarity Score: 0.8579873
Amount0.8579873
Unit1
Property / Recommended article: On the cost of computing roots of polynomials / qualifier
 
Property / Recommended article
 
Property / Recommended article: Polynomial-time algorithm for fixed points of nontrivial morphisms / rank
 
Normal rank
Property / Recommended article: Polynomial-time algorithm for fixed points of nontrivial morphisms / qualifier
 
Similarity Score: 0.85776305
Amount0.85776305
Unit1
Property / Recommended article: Polynomial-time algorithm for fixed points of nontrivial morphisms / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4205525 / rank
 
Normal rank
Property / Recommended article: Q4205525 / qualifier
 
Similarity Score: 0.8546661
Amount0.8546661
Unit1
Property / Recommended article: Q4205525 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Algorithmic regularity for polynomials and applications / rank
 
Normal rank
Property / Recommended article: Algorithmic regularity for polynomials and applications / qualifier
 
Similarity Score: 0.8530895
Amount0.8530895
Unit1
Property / Recommended article: Algorithmic regularity for polynomials and applications / qualifier
 
Property / Recommended article
 
Property / Recommended article: Polynomial complexity algorithms for computational problems in the theory of algebraic curves / rank
 
Normal rank
Property / Recommended article: Polynomial complexity algorithms for computational problems in the theory of algebraic curves / qualifier
 
Similarity Score: 0.8502454
Amount0.8502454
Unit1
Property / Recommended article: Polynomial complexity algorithms for computational problems in the theory of algebraic curves / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4712895 / rank
 
Normal rank
Property / Recommended article: Q4712895 / qualifier
 
Similarity Score: 0.8494069
Amount0.8494069
Unit1
Property / Recommended article: Q4712895 / qualifier
 

Latest revision as of 12:20, 4 April 2025

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