On the typical case complexity of graph optimization (Q2581548)

From MaRDI portal
Revision as of 19:38, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
On the typical case complexity of graph optimization
scientific article

    Statements

    On the typical case complexity of graph optimization (English)
    0 references
    10 January 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    Typical case complexity
    0 references
    Nonuniform polynomial time algorithm
    0 references
    Graph optimization
    0 references
    Concentration of hardness
    0 references
    0 references
    0 references