Settling the complexity of local max-cut (almost) completely (Q3012803)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Settling the complexity of local max-cut (almost) completely |
scientific article; zbMATH DE number 5917960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Settling the complexity of local max-cut (almost) completely |
scientific article; zbMATH DE number 5917960 |
Statements
Settling the Complexity of Local Max-Cut (Almost) Completely (English)
0 references
6 July 2011
0 references
Max-Cut
0 references
PLS
0 references
graphs
0 references
local search
0 references
smoothed complexity
0 references
0 references
0.9092865586280824
0 references
0.8948350548744202
0 references
0.880578875541687
0 references
0.8708524703979492
0 references
0.8579959273338318
0 references
