On the Parameterised Complexity of String Morphism Problems

Given a source string u and a target string w , to decide whether w can be obtained by applying a string morphism on u (i. e., uniformly replacing the symbols in u by strings) constitutes an 𝓝 𝓟 -complete problem. We present a multivariate analysis of this problem (and its many variants) from the vi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theory of computing systems Ročník 59; číslo 1; s. 24 - 51
Hlavní autoři: Fernau, Henning, Schmid, Markus L., Villanger, Yngve
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.07.2016
Springer Nature B.V
Témata:
Complexity theory
Computation
Computer Science
Hardness
Mathematical analysis
Multivariate analysis
Pinning
Strings
Studies
Symbols
Texts
Theory of Computation
String problems
String morphisms
Exponential time hypothesis
Parameterised complexity
Pattern languages
ISSN:1432-4350, 1433-0490
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Given a source string u and a target string w , to decide whether w can be obtained by applying a string morphism on u (i. e., uniformly replacing the symbols in u by strings) constitutes an 𝓝 𝓟 -complete problem. We present a multivariate analysis of this problem (and its many variants) from the viewpoint of parameterised complexity theory, thereby pinning down the sources of its computational hardness. Our results show that most parameterised variants of the string morphism problem are fixed-parameter intractable and, apart from some very special cases, tractable variants can only be obtained by considering a large part of the input as parameters, namely the length of w and the number of different symbols in u .
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-015-9635-3