Complexity of constructing Dixon resultant matrix (Q3174885)

From MaRDI portal
Revision as of 03:33, 16 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 of constructing Dixon resultant matrix
scientific article

    Statements

    title
    Complexity of constructing Dixon resultant matrix (English)
    0 references
    author
    Xiaolin Qin
    0 references
    Dingxiong Wu
    0 references
    Lin Tang
    0 references
    Zhenyi Ji
    0 references
    publication date
    18 July 2018
    0 references
    zbMATH Keywords
    polynomial system solving
    0 references
    elimination theory
    0 references
    Dixon resultant matrix
    0 references
    recursive algorithm
    0 references
    computational complexity
    0 references
    cites work
    Q4660683
    0 references
    Q3424914
    0 references
    Q4427316
    0 references
    Q4228470
    0 references
    Q4226953
    0 references
    Q4234291
    0 references
    Q4850733
    0 references
    Q5017593
    0 references

    Identifiers

    Mathematics Subject Classification ID
    13P15
    0 references
    68W10
    0 references
    68W30
    0 references
    zbMATH DE Number
    6905147
    0 references
    OpenAlex ID
    W2566721025
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3174885&oldid=36409664"
    Powered by MediaWiki