Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896)

From MaRDI portal
Revision as of 14:31, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers

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