Separating sets of strings by finding matching patterns is almost always hard (Q507598)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating sets of strings by finding matching patterns is almost always hard |
scientific article |
Statements
Separating sets of strings by finding matching patterns is almost always hard (English)
0 references
6 February 2017
0 references
pattern identification
0 references
parameterized complexity
0 references
computational complexity
0 references
