The following pages link to (Q3902993):
Displayed 12 items.
- Characterizing complexity classes by higher type primitive recursive definitions (Q1193623) (← links)
- Characterizing complexity classes by general recursive definitions in higher types (Q1207943) (← links)
- Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- Asymptotic invariants, complexity of groups and related problems (Q3143713) (← links)
- Computing on structures (Q4630296) (← links)
- Tailoring recursion for complexity (Q4632420) (← links)
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
- Primitive recursion in the abstract (Q5220181) (← links)
- On feasible numbers (Q6064275) (← links)