Pages that link to "Item:Q3165968"
From MaRDI portal
The following pages link to Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations (Q3165968):
Displaying 12 items.
- A combination framework for complexity (Q276251) (← links)
- Uncurrying for termination and complexity (Q352959) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- A Perron-Frobenius theorem for deciding matrix growth (Q2239274) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← links)
- (Q2980968) (← links)
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems (Q3014928) (← links)
- Automatic Termination (Q3636815) (← links)
- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (Q5200041) (← links)
- The Derivational Complexity Induced by the Dependency Pair Method (Q5902127) (← links)
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations (Q6118746) (← links)
