On the typical case complexity of graph optimization (Q2581548)

From MaRDI portal
Revision as of 21:09, 21 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q924145)
scientific article
Language Label Description Also known as
English
On the typical case complexity of graph optimization
scientific article

    Statements

    title
    On the typical case complexity of graph optimization (English)
    0 references
    publication date
    10 January 2006
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C85
    0 references
    90C35
    0 references
    zbMATH DE Number
    2244802
    0 references
    zbMATH Keywords
    Typical case complexity
    0 references
    Nonuniform polynomial time algorithm
    0 references
    Graph optimization
    0 references
    Concentration of hardness
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2581548&oldid=22303587"
    Powered by MediaWiki