Pages that link to "Item:Q1577477"
From MaRDI portal
The following pages link to Higher type recursion, ramification and polynomial time (Q1577477):
Displaying 19 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- Realizability models and implicit complexity (Q534712) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- A semantic proof of polytime soundness of light affine logic (Q987375) (← links)
- Implicit characterizations of FPTIME and NC revisited (Q1044672) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Control structures in programs and computational complexity (Q1772780) (← links)
- An arithmetic for non-size-increasing polynomial-time computation (Q1827388) (← links)
- Separating NC along the \(\delta\) axis (Q1827390) (← links)
- Automated higher-order complexity analysis (Q1827392) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- A higher-order characterization of probabilistic polynomial time (Q2343130) (← links)
- An arithmetic for polynomial-time computation (Q2500489) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- The Garland Measure and Computational Complexity of Stack Programs (Q4916233) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Cyclic implicit complexity (Q6649449) (← links)
