Pages that link to "Item:Q685537"

The following pages link to On the complexity of recursive path orderings (Q685537):

Displaying 7 items.

• The number of depth-first searches of an ordered set (Q909681) (← links)
• The computability path ordering (Q3196359) (← links)
• Polymorphic higher-order recursive path orderings (Q3546327) (← links)
• The complexity of counting problems in equational matching (Q5210797) (← links)
• Recursive Path Orderings Can Also Be Incremental (Q5387842) (← links)
• Combinatorial Algorithms for Listing Paths in Minimal Change Order (Q5458510) (← links)
• Improving associative path orderings (Q6488548) (← links)