Complexity results for triangular sets (Q1878489)

From MaRDI portal
Revision as of 20:22, 6 June 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 results for triangular sets
scientific article

    Statements

    title
    Complexity results for triangular sets (English)
    0 references
    author
    Éric Schost
    0 references
    publication date
    20 August 2004
    0 references
    Mathematics Subject Classification ID
    68W30
    0 references
    13P05
    0 references
    68W40
    0 references
    zbMATH DE Number
    2093530
    0 references
    zbMATH Keywords
    Triangular sets
    0 references
    Complexity
    0 references
    Symbolic Newton operator
    0 references
    describes a project that uses
    ISOLATE
    0 references
    Kronecker
    0 references
    cites work
    Q4714011
    0 references
    Q4227290
    0 references
    Q4329392
    0 references
    Q3973334
    0 references
    Q4474273
    0 references
    Q3033872
    0 references
    Q4352797
    0 references
    Q4425661
    0 references
    Q4695324
    0 references
    Q4714022
    0 references
    Q4863575
    0 references
    Q3973340
    0 references
    Q3070806
    0 references
    Q3973343
    0 references
    Q4352783
    0 references
    Q4660711
    0 references
    Q4248250
    0 references
    Q3851616
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1878489&oldid=34368527"
    Powered by MediaWiki