Pages that link to "Item:Q3527311"
From MaRDI portal
The following pages link to Bounded Second-Order Unification Is NP-Complete (Q3527311):
Displaying 6 items.
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Simplifying the signature in second-order unification (Q843951) (← links)
- Congruence Closure of Compressed Terms in Polynomial Time (Q3172897) (← links)
- On the building of affine retractions (Q3520151) (← links)
- Parameter Reduction in Grammar-Compressed Trees (Q3617731) (← links)
- Unification with Singleton Tree Grammars (Q3636835) (← links)
