Pattern Matching with Variables: A Multivariate Complexity Analysis
From MaRDI portal
Recommendations
- Pattern matching with variables: a multivariate complexity analysis
- A note on the complexity of matching patterns with variables
- Pattern matching with variables: fast algorithms and new hardness results
- Pattern matching with variables: efficient algorithms and complexity results
- The complexity of the multiple pattern matching problem for random strings
- scientific article; zbMATH DE number 7651042
- Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
- Pattern search algorithms for mixed variable programming
- Parameterized pattern matching: Algorithms and applications
- On the computational complexity of 2-interval pattern matching problems
Cited in
(8)- Matching patterns with variables
- Pattern matching with variables: a multivariate complexity analysis
- A note on the complexity of matching patterns with variables
- On the parameterized complexity of associative and commutative unification
- Pattern matching with variables: fast algorithms and new hardness results
- On the parameterised complexity of string morphism problems
- scientific article; zbMATH DE number 2081034 (Why is no real title available?)
- Pattern matching with variables: efficient algorithms and complexity results
This page was built for publication: Pattern Matching with Variables: A Multivariate Complexity Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928563)