Sparse polynomial division using a heap (Q540332)

From MaRDI portal
Revision as of 02:33, 4 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
Sparse polynomial division using a heap
scientific article

    Statements

    title
    Sparse polynomial division using a heap (English)
    0 references
    author
    Roman Pearce
    0 references
    Michael B. Monagan
    0 references
    publication date
    1 June 2011
    0 references
    zbMATH Keywords
    sparse polynomials
    0 references
    polynomial multiplication
    0 references
    polynomial division
    0 references
    polynomial data structures
    0 references
    heaps
    0 references
    describes a project that uses
    gmp
    0 references
    ALTRAN
    0 references
    SINGULAR
    0 references
    Magma
    0 references
    Maple
    0 references
    PARI/GP
    0 references
    TRIP
    0 references

    Identifiers

    zbMATH DE Number
    5903426
    0 references
    OpenAlex ID
    W2113737071
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q540332&oldid=35230079"
    Powered by MediaWiki