Intrinsic complexity estimates in polynomial optimization (Q2251913)

From MaRDI portal
Revision as of 16:40, 17 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
Intrinsic complexity estimates in polynomial optimization
scientific article

    Statements

    title
    Intrinsic complexity estimates in polynomial optimization (English)
    0 references
    author
    Bernd Bank
    0 references
    Marc Giusti
    0 references
    Joos Heintz
    0 references
    Mohab Safey El Din
    0 references
    publication date
    15 July 2014
    0 references
    zbMATH Keywords
    polynomial optimization
    0 references
    intrinsic complexity
    0 references
    degree of varieties
    0 references
    describes a project that uses
    Kronecker
    0 references
    RAGlib
    0 references
    cites work
    Q5389777
    0 references
    Q4331740
    0 references
    Q4386742
    0 references
    Q4342000
    0 references
    Q3992979
    0 references
    Q3135183
    0 references
    Q4660671
    0 references
    Q4302493
    0 references

    Identifiers

    Mathematics Subject Classification ID
    65Y20
    0 references
    68Q25
    0 references
    68W30
    0 references
    90C60
    0 references
    13P25
    0 references
    14P10
    0 references
    14Q15
    0 references
    zbMATH DE Number
    6317173
    0 references
    OpenAlex ID
    W2033158463
    0 references
    arXiv ID
    1304.5214
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2251913&oldid=38969019"
    Powered by MediaWiki