scientific article; zbMATH DE number 1114020
\(W\) hierarchyfinite model theoryfixed-parameter tractabilityparameterized complexityparametrized problems
Model theory of finite structures (03C13) Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30) Applications of computability and recursion theory (03D80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)
- Parameterized circuit complexity and the \(W\) hierarchy
- A descriptive complexity approach to the linear hierarchy.
- Describing parameterized complexity classes
- On the descriptive complexity of \(\overline{\varSigma ^*\overline{L}}\)
- The parameterized complexity of maximality and minimality problems
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
- Fixed-parameter tractability, definability, and model-checking
- A Purely Democratic Characterization of W[1]
- scientific article; zbMATH DE number 1222098 (Why is no real title available?)
- scientific article; zbMATH DE number 2086399 (Why is no real title available?)
- scientific article; zbMATH DE number 749922 (Why is no real title available?)
- The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
- An analysis of the W*-hierarchy
- Model-Checking Problems as a Basis for Parameterized Intractability
- Machine-based methods in parameterized complexity theory
- Parameterized complexity of weighted team definability
- Parameterized complexity of a parallel machine scheduling problem
- A new structural parameter on single machine scheduling with release dates and deadlines
- W-hierarchies defined by symmetric gates
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375789)
