Pages that link to "Item:Q5179012"
From MaRDI portal
The following pages link to The Descriptive Complexity of the Deterministic Exponential Time Hierarchy (Q5179012):
Displaying 7 items.
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
- Descriptive complexity of deterministic polylogarithmic time (Q2303589) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- Descriptive complexity (Q4227581) (← links)
- (Q4362919) (← links)
- New time hierarchy results for deterministic TMS (Q5096792) (← links)