Pattern Matching with Variables: A Multivariate Complexity Analysis
From MaRDI portal
Publication:4928563
DOI10.1007/978-3-642-38905-4_10zbMath1355.68116OpenAlexW201318262MaRDI QIDQ4928563
Markus L. Schmid, Henning Fernau
Publication date: 14 June 2013
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38905-4_10
NP-completenessmorphismsparameterised pattern matchingfunction matchingmembership problem for pattern languages
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
A parameterized study of maximum generalized pattern matching problems ⋮ On the parameterised complexity of string morphism problems ⋮ On the Parameterized Complexity of Associative and Commutative Unification ⋮ Pattern matching with variables: a multivariate complexity analysis
This page was built for publication: Pattern Matching with Variables: A Multivariate Complexity Analysis
