Local search: is brute-force avoidable? (Q439931)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6067700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local search: is brute-force avoidable? |
scientific article; zbMATH DE number 6067700 |
Statements
Local search: is brute-force avoidable? (English)
0 references
17 August 2012
0 references
parameterized complexity
0 references
local search
0 references
local treewidth
0 references
0 references
0 references
0.7568561434745789
0 references
0.7537221908569336
0 references
0.7491377592086792
0 references
0.7406763434410095
0 references
0.7344352006912231
0 references
