The following pages link to Complexity of matching problems (Q1099615):
Displaying 35 items.
- From heaps of matches to the limits of computability (Q396877) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Rewriting extended regular expressions (Q673635) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Solving (large scale) matching problems combinatorially (Q750322) (← links)
- Term rewriting and beyond -- theorem proving in Isabelle (Q909488) (← links)
- Anti-patterns for rule-based languages (Q968527) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- Unification problem in equational theories (Q1280985) (← links)
- The STO problem is NP-complete (Q1284283) (← links)
- Single elementary associative-commutative matching (Q1598445) (← links)
- ELAN from a rewriting logic point of view (Q1608914) (← links)
- From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories (Q1704601) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols (Q1744440) (← links)
- The complexity of linear and stratified context matching problems (Q1764421) (← links)
- The complexity of counting problems in equational matching (Q1914166) (← links)
- Variadic equational matching in associative and commutative theories (Q2029000) (← links)
- An efficient labelled nested multiset unification algorithm (Q2152299) (← links)
- On the complexity of optimal matching reconfiguration (Q2206232) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols (Q2424886) (← links)
- Computational complexity of existence problems for matchings in graphs. (Q2756482) (← links)
- Certifying term rewriting proofs in ELAN (Q2841249) (← links)
- On the Parameterized Complexity of Associative and Commutative Unification (Q2946004) (← links)
- Unnecessary inferences in associative-commutative completion procedures (Q3489486) (← links)
- The Complexity of Rationalizing Matchings (Q3596716) (← links)
- Associative-commutative discrimination nets (Q5044725) (← links)
- Some complexity theoretic aspects of AC rewriting (Q5096174) (← links)
- Optimization of rewriting and complexity of rewriting (Q5096207) (← links)
- The complexity of counting problems in equational matching (Q5210797) (← links)
- (Q5216313) (← links)
- A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (Q5504662) (← links)
- Computational complexity of simultaneous elementary matching problems (Q5900977) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Some results on equational unification (Q6488537) (← links)
