Pages that link to "Item:Q5466493"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466493):
Displaying 4 items.
- On miniaturized problems in parameterized complexity theory (Q820145) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)