Pages that link to "Item:Q1354329"
From MaRDI portal
The following pages link to A term rewriting characterization of the polytime functions and related complexity classes (Q1354329):
Displaying 8 items.
- A term rewriting characterization of the functions computable in polynomial space (Q1407521) (← links)
- A new order-theoretic characterisation of the polytime computable functions (Q2346988) (← links)
- 2004 Summer Meeting of the Association for Symbolic Logic (Q3370624) (← links)
- A lexicographic path order with slow growing derivation bounds (Q3619873) (← links)
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's <i>T</i>: a case study (Q4254685) (← links)
- Proving consistency of equational theories in bounded arithmetic (Q4532615) (← links)
- Complexity Analysis by Rewriting (Q5458433) (← links)
- On basic feasible functionals and the interpretation method (Q6629518) (← links)
