W-hierarchies defined by symmetric gates
DOI10.1007/S00224-008-9138-6zbMATH Open1211.68217OpenAlexW2126048752WikidataQ57359767 ScholiaQ57359767MaRDI QIDQ970108FDOQ970108
Danny Hermelin, Michael R. Fellows, Moritz Müller, Frances Rosamond, Jörg Flum
Publication date: 10 May 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-008-9138-6
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Mathematical problems of computer architecture (68M07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relating monotone formula size and monotone depth of Boolean functions
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- On the parameterized complexity of short computation and factorization
- Machine-based methods in parameterized complexity theory
- The parameterized complexity of maximality and minimality problems
- Parameterized Complexity of Independence and Domination on Geometric Graphs
Cited In (4)
- Parameterized complexity classes defined by threshold circuits and their connection with sorting networks
- Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes
- Parameterizations of hitting set of bundles and inverse scope
- Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems
This page was built for publication: W-hierarchies defined by symmetric gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970108)
