On the parameterised complexity of string morphism problems (Q315525)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the parameterised complexity of string morphism problems
scientific article

    Statements

    On the parameterised complexity of string morphism problems (English)
    0 references
    0 references
    0 references
    0 references
    21 September 2016
    0 references
    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