Computing equality-free and repetitive string factorisations (Q2634669)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6542060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing equality-free and repetitive string factorisations |
scientific article; zbMATH DE number 6542060 |
Statements
Computing equality-free and repetitive string factorisations (English)
0 references
18 February 2016
0 references
string factorisations
0 references
NP-hard string problems
0 references
parameterised complexity
0 references
multivariate algorithmics
0 references
0 references
0.97943246
0 references
0.8910117
0 references
0 references
0.8836093
0 references
0.8664754
0 references
0.8640716
0 references
0.86063594
0 references
0.8523607
0 references
0.8459462
0 references
