Separating sets of strings by finding matching patterns is almost always hard (Q507598)
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: Separating sets of strings by finding matching patterns is almost always hard |
scientific article; zbMATH DE number 6680984
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separating sets of strings by finding matching patterns is almost always hard |
scientific article; zbMATH DE number 6680984 |
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
0.7646608352661133
0 references
0.7345693111419678
0 references
0.7340773344039917
0 references
0.7311097979545593
0 references
