Pages that link to "Item:Q5055719"
From MaRDI portal
The following pages link to Termination proofs and the length of derivations (Q5055719):
Displaying 34 items.
- A combination framework for complexity (Q276251) (← links)
- The derivational complexity of string rewriting systems (Q441853) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982) (← links)
- Generating polynomial orderings (Q1318775) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Constant runtime complexity of term rewriting is semi-decidable (Q1799562) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- Real or natural number interpretation and their effect on complexity (Q2346989) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← links)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- Derivation lengths classification of Gödel's T extending Howard's assignment (Q2881086) (← links)
- On the Computational Content of Termination Proofs (Q3195706) (← links)
- Arctic Termination ...Below Zero (Q3522019) (← links)
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (Q3522024) (← links)
- Automated Implicit Computational Complexity Analysis (System Description) (Q3541694) (← links)
- Automated Complexity Analysis Based on the Dependency Pair Method (Q3541717) (← links)
- (Q3794178) (← links)
- (Q4016542) (← links)
- On Subquadratic Derivational Complexity of Semi-Thue Systems (Q5042260) (← links)
- Incremental termination proofs and the length of derivations (Q5055748) (← links)
- Time bounded rewrite systems and termination proofs by generalized embedding (Q5055749) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q5096206) (← links)
- Complexity Analysis by Rewriting (Q5458433) (← links)
- Type removal in term rewriting (Q5881182) (← links)
- Derivation lengths and order types of Knuth--Bendix orders (Q5958622) (← links)
- An automated approach to the Collatz conjecture (Q6103589) (← links)
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations (Q6118746) (← links)
- Analysing parallel complexity of term rewriting (Q6160759) (← links)
- On complexity bounds and confluence of parallel term rewriting (Q6622000) (← links)
