On the Complexity of Computing Critical Points with Gröbner Bases (Q2934482)

From MaRDI portal
Revision as of 10:03, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the Complexity of Computing Critical Points with Gröbner Bases
scientific article

    Statements

    On the Complexity of Computing Critical Points with Gröbner Bases (English)
    0 references
    12 December 2014
    0 references
    critical points
    0 references
    polynomial minimization
    0 references
    complexity
    0 references
    Groebner basis
    0 references
    structured polynomial system
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references