Pages that link to "Item:Q2180239"
From MaRDI portal
The following pages link to Transforming derivational complexity of term rewriting to runtime complexity (Q2180239):
Displaying 5 items.
- From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- (Q3589635) (← links)
- Trace rewriting: Computing normal forms in time O(n log n) (Q4593937) (← links)
- From innermost to full almost-sure termination of probabilistic term rewriting (Q6629527) (← links)