Sparse FGLM algorithms (Q1711988)

From MaRDI portal
Revision as of 05:30, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Sparse FGLM algorithms
scientific article

    Statements

    title
    Sparse FGLM algorithms (English)
    0 references
    author
    Jean-Charles Faugère
    0 references
    Chenqi Mou
    0 references
    publication date
    21 January 2019
    0 references
    zbMATH Keywords
    Gröbner bases
    0 references
    change of ordering
    0 references
    zero-dimensional ideal
    0 references
    sparse matrix
    0 references
    Wiedemann algorithm
    0 references
    BMS algorithm
    0 references
    cites work
    Q4660641
    0 references
    Q4234296
    0 references
    Q4693774
    0 references
    Q3714165
    0 references
    Q4209232
    0 references
    Q4317713
    0 references
    Q4660688
    0 references
    Q4050885
    0 references
    Q4489180
    0 references
    Q3325833
    0 references
    Q5462454
    0 references
    Q4000024
    0 references
    Q4406533
    0 references
    Elimination methods
    0 references

    Identifiers

    Mathematics Subject Classification ID
    13P10
    0 references
    68W30
    0 references
    65F50
    0 references
    zbMATH DE Number
    7003720
    0 references
    OpenAlex ID
    W2238531909
    0 references
    arXiv ID
    1304.1238
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1711988&oldid=38711824"
    Powered by MediaWiki