On the typical case complexity of graph optimization (Q2581548): Difference between revisions
From MaRDI portal
Latest revision as of 14:56, 11 June 2024
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
Typical case complexity
0 references
Nonuniform polynomial time algorithm
0 references
Graph optimization
0 references
Concentration of hardness
0 references