Surfing with Rod
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1222098 (Why is no real title available?)
- scientific article; zbMATH DE number 1341905 (Why is no real title available?)
- scientific article; zbMATH DE number 1543076 (Why is no real title available?)
- Advice classes of parametrized tractability
- Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
- Nonconstructive advances in polynomial-time complexity
- Nonconstructive tools for proving polynomial-time decidability
- On Problems without Polynomial Kernels (Extended Abstract)
- Parameterized circuit complexity and the \(W\) hierarchy
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- The birth and early years of parameterized complexity
- Threshold dominating sets and an improved characterization of \(W[2]\)
This page was built for publication: Surfing with Rod
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2973715)