Algorithms in the W-hierarchy

DOI10.1007/S00224-007-1325-3zbMATH Open1148.68022OpenAlexW2030552895MaRDI QIDQ2464321FDOQ2464321

Authors: Tarique Islam, Jonathan F. Buss 

Publication date: 19 December 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-1325-3

Recommendations

• Machine-based methods in parameterized complexity theory
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
• scientific article; zbMATH DE number 1754598
• An analysis of the W*-hierarchy

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (3)

• The parameterized complexity of maximality and minimality problems
• An analysis of the WITT algorithm
• Lord-Wingersky algorithm Version 2.5 with applications

This page was built for publication: Algorithms in the W-hierarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464321)