Skip to main navigation Skip to search Skip to main content

A purely democratic characterization of W[1]

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

We give a novel characterization of W[1], the most important fixed-parameter intractability class in the W-hierarchy, using Boolean circuits that consist solely of majority gates. Such gates have a Boolean value of 1 if and only if more than half of their inputs have value 1. Using majority circuits, we define an analog of the W-hierarchy which we call the W̃-hierarchy, and show that W[1] = W̃[1] and W[t] ⊂ W̃[t] for all [t]. This gives the first characterization of W[1] based on the weighted satisfiability problem for monotone Boolean circuits rather than antimonotone. Our results are part of a wider program aimed at exploring the robustness of the notion of weft, showing that it remains a key parameter governing the combinatorial nondeterministic computing strength of circuits, no matter what type of gates these circuits have.

Original languageEnglish
Title of host publicationParameterized and Exact Computation - Third International Workshop, IWPEC 2008, Proceedings
Pages103-114
Number of pages12
DOIs
StatePublished - 9 Jun 2008
Externally publishedYes
Event3rd International Workshop on Parameterized and Exact Computation, IWPEC 2008 - Victoria, BC, Canada
Duration: 14 May 200816 May 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5018 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Workshop on Parameterized and Exact Computation, IWPEC 2008
Country/TerritoryCanada
CityVictoria, BC
Period14/05/0816/05/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A purely democratic characterization of W[1]'. Together they form a unique fingerprint.

Cite this