Pages that link to "Item:Q2343093"
From MaRDI portal
The following pages link to On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093):
Displaying 17 items.
- Multistage graph problems on a global budget (Q831134) (← links)
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- The parameterized space complexity of embedding along a path (Q2408562) (← links)
- Some lower bounds in parameterized \(\mathrm{AC}^{0}\) (Q2417855) (← links)
- Computing Hitting Set Kernels By AC^0-Circuits (Q3304103) (← links)
- On the Space Complexity of Parameterized Problems (Q4899254) (← links)
- (Q4972729) (← links)
- (Q5009475) (← links)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
- Parameterized Parallel Computing and First-Order Logic (Q5049039) (← links)
- Parameterised counting in logspace (Q6093373) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
- Space-efficient graph kernelizations (Q6636090) (← links)
