Simplifying the weft hierarchy

DOI10.1016/J.TCS.2005.10.002zbMath1088.68065OpenAlexW2102862468WikidataQ56384733 ScholiaQ56384733MaRDI QIDQ820144

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

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)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• On the parameterized complexity of short computation and factorization
• Fixed-Parameter Tractability, Definability, and Model-Checking
• On the Amount of Nondeterminism and the Power of Verifying
• Computer Science Logic

This page was built for publication: Simplifying the weft hierarchy