Pages that link to "Item:Q2581756"
From MaRDI portal
The following pages link to Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756):
Displaying 9 items.
- Confronting intractability via parameters (Q465686) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Bounded fixed-parameter tractability and reducibility (Q2382273) (← links)
- The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
- Hybridization Number on Three Rooted Binary Trees is EPT (Q2818206) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- (Q4972729) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
