Local search for string problems: brute-force is essentially optimal (Q2437744)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local search for string problems: brute-force is essentially optimal |
scientific article |
Statements
Local search for string problems: brute-force is essentially optimal (English)
0 references
13 March 2014
0 references
local search
0 references
parameterized complexity
0 references
parameterized intractability
0 references
closest string
0 references
longest common subsequence
0 references
shortest common supersequence
0 references
shortest common superstring
0 references
