Bounded fixed-parameter tractability and reducibility
DOI10.1016/J.APAL.2007.06.001zbMATH Open1149.03031OpenAlexW2094650442MaRDI QIDQ2382273FDOQ2382273
Authors: Martin Grohe, Mark Weyer, Rodney G. Downey, Jörg Flum 
Publication date: 28 September 2007
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2007.06.001
Recommendations
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Graph minors. XIII: The disjoint paths problem
- Parametrized complexity theory.
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Title not available (Why is that?)
- On the structure of parameterized problems in NP
- The complexity of first-order and monadic second-order logic revisited
- Title not available (Why is that?)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
- On the Amount of Nondeterminism and the Power of Verifying
- Machine-based methods in parameterized complexity theory
- Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
- On fixed-parameter tractability and approximability of NP optimization problems
- Parameterized and Exact Computation
Cited In (7)
This page was built for publication: Bounded fixed-parameter tractability and reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2382273)
