Pages that link to "Item:Q2889573"
From MaRDI portal
The following pages link to On the complexity of bounded second-order unification and stratified context unification (Q2889573):
Displaying 7 items.
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- On rewrite constraints and context unification (Q1607044) (← links)
- Decidability of bounded second order unification (Q1887168) (← links)
- Congruence Closure of Compressed Terms in Polynomial Time (Q3172897) (← links)
- Bounded Second-Order Unification Is NP-Complete (Q3527311) (← links)
- Stratified Context Unification Is NP-Complete (Q3613402) (← links)
- Linear pattern matching of compressed terms and polynomial rewriting (Q4585011) (← links)