The following pages link to Stefano Mazzanti (Q342701):
Displaying 20 items.
- (Q211503) (redirect page) (← links)
- Regressive computations characterize logarithmic space (Q342702) (← links)
- Succinct iterative characterizations of primitive computable unary functions (Q672834) (← links)
- Unbounded recursion and non-size-increasing functions (Q737105) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- Primitive iteration and unary functions (Q1115608) (← links)
- General iteration and unary functions (Q1182467) (← links)
- Cantor diagrams: a unifying discussion of self-reference (Q1404250) (← links)
- (Q2776813) (← links)
- Bases for AC0 and Other Complexity Classes (Q2805414) (← links)
- (Q2847783) (← links)
- Bounded iteration and unary functions (Q3159406) (← links)
- CRN Elimination and Substitution Bases for Complexity Classes (Q3168519) (← links)
- (Q3216120) (← links)
- (Q3773864) (← links)
- (Q3815464) (← links)
- Iterative Characterizations of Computable Unary Functions: A General Method (Q4333464) (← links)
- New substitution bases for complexity classes (Q5112387) (← links)
- Iteration on notation and unary functions (Q5396224) (← links)
- Non-deterministic closure theory and universal arrows (Q5947272) (← links)
