Pages that link to "Item:Q1295429"
From MaRDI portal
The following pages link to Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429):
Displaying 11 items.
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Higher type recursion, ramification and polynomial time (Q1577477) (← links)
- A characterization of alternating log time by ramified recurrence (Q1978645) (← links)
- Feasible functionals and intersection of ramified types (Q2842842) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- Tiering as a Recursion Technique (Q3370611) (← links)
- Taming Modal Impredicativity: Superlazy Reduction (Q3605525) (← links)
- (Q4436023) (← links)
- Types for Proofs and Programs (Q5712304) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Cyclic implicit complexity (Q6649449) (← links)