On the parameterised complexity of string morphism problems (Q2963897)
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 6687754
| 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 6687754 |
Statements
21 February 2017
0 references
string problems
0 references
string morphisms
0 references
parameterised complexity
0 references
exponential time hypothesis
0 references
pattern languages
0 references
0.9509001970291138
0 references
0.7248958349227905
0 references
0.7207578420639038
0 references
0.7029173374176025
0 references
0.7024509906768799
0 references
