Affordable Access

On the Parameterised Complexity of String Morphism Problems

Authors
Publication Date
Source
Dagstuhl Research Online Publication Server
Keywords
  • String Problems, String Morphisms, Parameterised Complexity, Exponential Time Hypothesis, Pattern La
  • Data Processing Computer Science
External links

Abstract

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments