Pages that link to "Item:Q1183416"
From MaRDI portal
The following pages link to Characterizing parallel hierarchies by reducibilities (Q1183416):
Displayed 6 items.
- On input read-modes of alternating Turing machines (Q672377) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)