Pages that link to "Item:Q2346415"
From MaRDI portal
The following pages link to Pattern matching with variables: a multivariate complexity analysis (Q2346415):
Displaying 22 items.
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Closure properties of pattern languages (Q340552) (← links)
- Patterns with bounded treewidth (Q476169) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Blocksequences of \(k\)-local words (Q831795) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- Finitely distinguishable erasing pattern languages (Q2290682) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Distinguishing pattern languages with membership examples (Q2407113) (← links)
- A note on the complexity of matching patterns with variables (Q2445237) (← links)
- Re-examining regular expressions with backreferences (Q2699953) (← links)
- On the Solvability Problem for Restricted Classes of Word Equations (Q2817397) (← links)
- Pattern matching with variables: fast algorithms and new hardness results (Q2955004) (← links)
- On the Complexity of Solving Restricted Word Equations (Q4683237) (← links)
- Pattern Matching with Variables: A Multivariate Complexity Analysis (Q4928563) (← links)
- Pattern Matching with Variables (Q5053058) (← links)
- (Q5091271) (← links)
- The hardness of solving simple word equations (Q5111232) (← links)
- (Q5136316) (← links)
- Matching patterns with variables under edit distance (Q6111591) (← links)
- Matching patterns with variables under Simon's congruence (Q6623024) (← links)
- Languages generated by conjunctive query fragments of FC[REG] (Q6661764) (← links)
