pdf-format: |
|
@InProceedings{fernau_et_al:LIPIcs:2013:4361, author = {Henning Fernau and Markus L. Schmid and Yngve Villanger}, title = {{On the Parameterised Complexity of String Morphism Problems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {55--66}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Anil Seth and Nisheeth K. Vishnoi}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4361}, URN = {urn:nbn:de:0030-drops-43619}, doi = {10.4230/LIPIcs.FSTTCS.2013.55}, annote = {Keywords: String Problems, String Morphisms, Parameterised Complexity, Exponential Time Hypothesis, Pattern Languages} }
Keywords: | String Problems, String Morphisms, Parameterised Complexity, Exponential Time Hypothesis, Pattern Languages | |
Seminar: | IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013) | |
Issue date: | 2013 | |
Date of publication: | 10.12.2013 |