On the parameterised complexity of string morphism problems (Q315525)
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: On the parameterised complexity of string morphism problems |
scientific article; zbMATH DE number 6628963
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterised complexity of string morphism problems |
scientific article; zbMATH DE number 6628963 |
Statements
On the parameterised complexity of string morphism problems (English)
0 references
21 September 2016
0 references
string problems
0 references
string morphisms
0 references
parameterised complexity
0 references
exponential time hypothesis
0 references
pattern languages
0 references
0 references
0.9509001970291138
0 references
0.7696218490600586
0 references
0.749344527721405
0 references
0.7428088188171387
0 references
0.7400110960006714
0 references
