Pages that link to "Item:Q1401939"
From MaRDI portal
The following pages link to Analysing the implicit complexity of programs. (Q1401939):
Displaying 13 items.
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- On sharing, memoization, and polynomial time (Q1640979) (← links)
- A new order-theoretic characterisation of the polytime computable functions (Q2346988) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- On quasi-interpretations, blind abstractions and implicit complexity (Q2909730) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (Q3522024) (← links)
- Automated Implicit Computational Complexity Analysis (System Description) (Q3541694) (← links)
- Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
- (Q5013812) (← links)
- (Q5014441) (← links)
- Complexity Analysis by Rewriting (Q5458433) (← links)
