Computing equality-free and repetitive string factorisations (Q2634669): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:22, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing equality-free and repetitive string factorisations |
scientific article |
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
