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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theory of computing systems Jg. 59; H. 1; S. 24 - 51
Hauptverfasser: Fernau, Henning, Schmid, Markus L., Villanger, Yngve
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.07.2016
Springer Nature B.V
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 .
Bibliographie: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