Pages that link to "Item:Q1201724"
From MaRDI portal
The following pages link to Tight complexity bounds for term matching problems (Q1201724):
Displaying 8 items.
- Single elementary associative-commutative matching (Q1598445) (← links)
- The complexity of linear and stratified context matching problems (Q1764421) (← links)
- Algorithms and reductions for rewriting problems. II. (Q1853144) (← links)
- Unification and matching on compressed terms (Q2946645) (← links)
- Linear pattern matching of compressed terms and polynomial rewriting (Q4585011) (← links)
- Associative-commutative discrimination nets (Q5044725) (← links)
- Generating tables for bottom-up matching (Q5055801) (← links)
- Some complexity theoretic aspects of AC rewriting (Q5096174) (← links)