Complexity of integer quasiconvex polynomial optimization (Q2387421)

From MaRDI portal
Revision as of 18:52, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    zbMATH Keywords
    Integer optimization
    0 references
    Quasiconvex polynomial
    0 references
    Lenstra's algorithm
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C10
    0 references
    68Q25
    0 references
    90C60
    0 references
    zbMATH DE Number
    2201765
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2387421&oldid=15013057"
    Powered by MediaWiki