On the parameterised complexity of string morphism problems
From MaRDI portal
Publication:315525
DOI10.1007/s00224-015-9635-3zbMath1350.68139MaRDI QIDQ315525
Henning Fernau, Markus L. Schmid, Yngve Villanger
Publication date: 21 September 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2013/4361/
exponential time hypothesis; string morphisms; parameterised complexity; pattern languages; string problems