Pages that link to "Item:Q315525"
From MaRDI portal
The following pages link to On the parameterised complexity of string morphism problems (Q315525):
Displaying 15 items.
- Incremental problems in the parameterized complexity setting (Q519883) (← links)
- Blocksequences of \(k\)-local words (Q831795) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- Parameterized dictionary matching and recognition with one gap (Q2220853) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Distinguishing pattern languages with membership examples (Q2407113) (← links)
- On the Solvability Problem for Restricted Classes of Word Equations (Q2817397) (← links)
- On the parameterised complexity of string morphism problems (Q2963897) (← links)
- (Q4608614) (← links)
- (Q5091271) (← links)
- The hardness of solving simple word equations (Q5111232) (← links)
- Matching patterns with variables under edit distance (Q6111591) (← links)
- Variant Satisfiability of Parameterized Strings (Q6486037) (← links)
- Matching patterns with variables under Simon's congruence (Q6623024) (← links)
- Languages generated by conjunctive query fragments of FC[REG] (Q6661764) (← links)