Complexity of integer quasiconvex polynomial optimization (Q2387421)

From MaRDI portal
Revision as of 15:59, 10 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 of integer quasiconvex polynomial optimization
scientific article

    Statements

    title
    Complexity of integer quasiconvex polynomial optimization (English)
    0 references
    author
    Sebastian Heinz
    0 references
    publication date
    2 September 2005
    0 references
    Mathematics Subject Classification ID
    90C10
    0 references
    68Q25
    0 references
    90C60
    0 references
    zbMATH DE Number
    2201765
    0 references
    zbMATH Keywords
    Integer optimization
    0 references
    Quasiconvex polynomial
    0 references
    Lenstra's algorithm
    0 references
    OpenAlex ID
    W2069855806
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2387421&oldid=34418095"
    Powered by MediaWiki