Pages that link to "Item:Q2343123"
From MaRDI portal
The following pages link to On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123):
Displaying 12 items.
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Linear logic and elementary time (Q1401946) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- Combining linear logic and size types for implicit complexity (Q1989323) (← links)
- Polynomial time in untyped elementary linear logic (Q1989326) (← links)
- Soft linear logic and polynomial complexity classes (Q2866738) (← links)
- (Q4681363) (← links)
- (Q5079730) (← links)
- (Q5092325) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Linear Logic Properly Displayed (Q5886520) (← links)