Local search: is brute-force avoidable? (Q439931): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68T20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6067700 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parameterized complexity | |||
| Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
local search | |||
| Property / zbMATH Keywords: local search / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
local treewidth | |||
| Property / zbMATH Keywords: local treewidth / rank | |||
Normal rank | |||
Revision as of 00:50, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local search: is brute-force avoidable? |
scientific article |
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
