Steepest ascent can be exponential in bounded treewidth problems (Q2183191)
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: Steepest ascent can be exponential in bounded treewidth problems |
scientific article; zbMATH DE number 7204101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Steepest ascent can be exponential in bounded treewidth problems |
scientific article; zbMATH DE number 7204101 |
Statements
Steepest ascent can be exponential in bounded treewidth problems (English)
0 references
26 May 2020
0 references
local search
0 references
steepest ascent
0 references
long path
0 references
VCSP
0 references
bounded treewidth
0 references
fitness landscape
0 references
0.7420049905776978
0 references
0.7124190330505371
0 references
0.7090067267417908
0 references
0.7004175186157227
0 references
