## Abstract

The classes of the W-hierarchy are the most important classes of intractable problems in parameterized complexity. These classes were originally defined via the weighted satisfiability problem for Boolean circuits. Here, besides the Boolean connectives we consider connectives such as majority, not-all-equal, and unique. For example, a gate labelled by the majority connective outputs true if more than half of its inputs are true. For any finite set C of connectives we construct the corresponding W(C)-hierarchy. We derive some general conditions which guarantee that the W-hierarchy and the W(C)-hierarchy coincide levelwise. If C only contains the majority connective then the first levels of the hierarchies coincide. We use this to show that a variant of the parameterized vertex cover problem, the majority vertex cover problem, is W[1]-complete.

Original language | English |
---|---|

Pages (from-to) | 311-339 |

Number of pages | 29 |

Journal | Theory of Computing Systems |

Volume | 46 |

Issue number | 2 |

DOIs | |

State | Published - 1 Feb 2010 |

Externally published | Yes |

## Keywords

- Bounded weft circuits
- Parameterized complexity
- Symmetric gates
- W-hierarchy

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics