Simplifying the weft hierarchy

DOI10.1016/J.TCS.2005.10.002zbMATH Open1088.68065OpenAlexW2102862468WikidataQ56384733 ScholiaQ56384733MaRDI QIDQ820144FDOQ820144

Authors: Jonathan F. Buss, Tarique Islam 

Publication date: 6 April 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.002

Recommendations

• Parameterized and Exact Computation
• Parameterized circuit complexity and the \(W\) hierarchy
• Parameterized Complexity Classes under Logical Reductions
• scientific article; zbMATH DE number 7378390
• A Purely Democratic Characterization of W[1]

zbMATH Keywords

fixed-parameter complexity\(W\)-hierarchyweft

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Title not available (Why is that?)
• On the parameterized complexity of short computation and factorization
• On the Amount of Nondeterminism and the Power of Verifying
• Fixed-parameter tractability, definability, and model-checking
• Computer Science Logic

Cited In (3)

• Parameterized and Exact Computation
• Title not available (Why is that?)
• A Topologically Complete Theory of Weaving

This page was built for publication: Simplifying the weft hierarchy

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