Automated Complexity Analysis Based on Context-Sensitive Rewriting
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2087550
- Complexity Analysis by Rewriting
- Joint spectral radius theory for automated complexity analysis of rewrite systems
- Derivational complexity and context-sensitive Rewriting
- Complexity analysis of term-rewriting systems
- Automated higher-order complexity analysis
- Automated complexity analysis of Nuprl extracted programs
- Complexity analysis of term rewriting based on matrix and context dependent interpretations
- Runtime complexity analysis of logically constrained rewriting
- Automated Complexity Analysis Based on the Dependency Pair Method
Cited in
(16)- scientific article; zbMATH DE number 6744203 (Why is no real title available?)
- Analysing parallel complexity of term rewriting
- A combination framework for complexity
- Automated amortised resource analysis for term rewrite systems
- Complexity of conditional term rewriting
- scientific article; zbMATH DE number 2040721 (Why is no real title available?)
- Complexity Analysis by Rewriting
- Applications and extensions of context-sensitive rewriting
- On complexity bounds and confluence of parallel term rewriting
- Automated Implicit Computational Complexity Analysis (System Description)
- A Perron-Frobenius theorem for deciding matrix growth
- A new order-theoretic characterisation of the polytime computable functions
- Automated Complexity Analysis Based on the Dependency Pair Method
- Automated complexity analysis based on ordered resolution
- Derivational complexity and context-sensitive Rewriting
- scientific article; zbMATH DE number 2087550 (Why is no real title available?)
This page was built for publication: Automated Complexity Analysis Based on Context-Sensitive Rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170821)