scientific article; zbMATH DE number 1114020
zbMATH Open0897.03029MaRDI QIDQ4375789FDOQ4375789
Authors: Michael R. Fellows, Rodney G. Downey, Kenneth W. Regan 
Publication date: 11 October 1998
Title of this publication is not available (Why is that?)
Recommendations
finite model theoryfixed-parameter tractabilityparameterized complexityparametrized problems\(W\) hierarchy
Analysis of algorithms and problem complexity (68Q25) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (14)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
- A descriptive complexity approach to the linear hierarchy.
- W-hierarchies defined by symmetric gates
- The parameterized complexity of maximality and minimality problems
- Model-Checking Problems as a Basis for Parameterized Intractability
- A Purely Democratic Characterization of W[1]
- Title not available (Why is that?)
- Parameterized complexity of weighted team definability
- Machine-based methods in parameterized complexity theory
- Describing parameterized complexity classes
- Fixed-parameter tractability, definability, and model-checking
- The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
- On the descriptive complexity of \(\overline{\varSigma ^*\overline{L}}\)
- An analysis of the W*-hierarchy
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)
