The following pages link to (Q4339320):
Displaying 7 items.
- Implicit characterizations of FPTIME and NC revisited (Q1044672) (← links)
- A term rewriting characterization of the functions computable in polynomial space (Q1407521) (← links)
- Characterizing the elementary recursive functions by a fragment of Gödel's \(T\) (Q1590659) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- (Q4781604) (← links)
- A Refinement of the μ-measure for Stack Programs (Q4916234) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)