Complexity analysis of term rewriting based on matrix and context dependent interpretations
From MaRDI portal
Recommendations
- Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
- Joint spectral radius theory for automated complexity analysis of rewrite systems
- Modular complexity analysis for term rewriting
- scientific article; zbMATH DE number 1722702
Cited in
(20)- Complexity analysis of term-rewriting systems
- Applications and extensions of context-sensitive rewriting
- Derivational complexity and context-sensitive Rewriting
- A Perron-Frobenius theorem for deciding matrix growth
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- A combination framework for complexity
- Complexity of conditional term rewriting
- Joint spectral radius theory for automated complexity analysis of rewrite systems
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
- Uncurrying for termination and complexity
- Automatic Termination
- Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
- A dependency pair framework for innermost complexity analysis of term rewrite systems
- Polynomially bounded matrix interpretations
- Modular complexity analysis for term rewriting
- The Derivational Complexity Induced by the Dependency Pair Method
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations
- Small term reachability and related problems for terminating term rewriting systems
- The Factorization Algorithm of Berlekamp and Zassenhaus
This page was built for publication: Complexity analysis of term rewriting based on matrix and context dependent interpretations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3165968)
