Pages that link to "Item:Q2908538"
From MaRDI portal
The following pages link to Parameterized Complexity and Subexponential-Time Computability (Q2908538):
Displaying 10 items.
- Subexponential parameterized algorithms (Q458457) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- (Q3974876) (← links)