The following pages link to Polynomial path orders (Q2865062):
Displaying 11 items.
- A combination framework for complexity (Q276251) (← links)
- Generating polynomial orderings (Q1318775) (← links)
- Analysing the implicit complexity of programs. (Q1401939) (← links)
- From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) (← links)
- A new order-theoretic characterisation of the polytime computable functions (Q2346988) (← links)
- (Q2980968) (← links)
- Polymorphic higher-order recursive path orderings (Q3546327) (← links)
- A lexicographic path order with slow growing derivation bounds (Q3619873) (← links)
- Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
- Query order in the polynomial hierarchy (Q5055937) (← links)
- On basic feasible functionals and the interpretation method (Q6629518) (← links)