Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752)

From MaRDI portal
Revision as of 09:42, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
scientific article

    Statements

    title
    Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (English)
    0 references
    author
    Adrien Poteaux
    0 references
    Marc Rybowicz
    0 references
    publication date
    20 June 2012
    0 references
    zbMATH Keywords
    Puiseux series
    0 references
    complexity
    0 references
    algebraic functions
    0 references
    describes a project that uses
    Magma
    0 references
    Maple
    0 references
    cites work
    Q4755237
    0 references
    Q5301646
    0 references
    Q3715247
    0 references
    Q5810622
    0 references
    Q3776501
    0 references
    Q3476962
    0 references
    Q5531597
    0 references
    Q4660637
    0 references
    Q5302071
    0 references
    Q5301681
    0 references
    Q4359470
    0 references
    Q4226968
    0 references
    Q4248250
    0 references
    Q4183410
    0 references
    Q3963124
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W30
    0 references
    12Y05
    0 references
    13P05
    0 references
    14Q05
    0 references
    14H50
    0 references
    zbMATH DE Number
    6048424
    0 references
    OpenAlex ID
    W2050415272
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q429752&oldid=35285558"
    Powered by MediaWiki