Pages that link to "Item:Q3796803"
From MaRDI portal
The following pages link to Parallel Algorithms for Term Matching (Q3796803):
Displaying 8 items.
- A note on the parallel complexity of anti-unification (Q688579) (← links)
- Efficient parallel term matching and anti-unification (Q688582) (← links)
- Complexity of matching problems (Q1099615) (← links)
- On the relationship of congruence closure and unification (Q1124338) (← links)
- Optimal parallel algorithms for forest and term matching (Q1186605) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem (Q1960430) (← links)
- Processor efficient parallel matching (Q2471700) (← links)