Pages that link to "Item:Q1144374"
From MaRDI portal
The following pages link to The logic-termal equivalence is polynomial-time decidable (Q1144374):
Displaying 4 items.
- Tree equivalence of linear recursive schemata is polynomial-time decidable (Q1162152) (← links)
- Mixed computation: potential applications and problems for study (Q1169808) (← links)
- On complexity of the anti-unification problem (Q3184519) (← links)
- Analysis of the equality relations for the program terms (Q5030193) (← links)
