On the parameterised complexity of string morphism problems
From MaRDI portal
Publication:2963897
Recommendations
Cited in
(7)- scientific article; zbMATH DE number 6851884 (Why is no real title available?)
- On the parameterised complexity of string morphism problems
- Document spanners: from expressive power to decision problems
- Closure properties of pattern languages
- The invariant problem for binary string structures and the parallel complexity theory of queries
- Variant Satisfiability of Parameterized Strings
- scientific article; zbMATH DE number 7278096 (Why is no real title available?)
This page was built for publication: On the parameterised complexity of string morphism problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963897)