W-hierarchy

The W-Hierarchy is a hierarchy of complexity classes in parameterized complexity theory that stratifies decision problems according to the degree of hardness based on the weft of Boolean circuits, with each level W[t] capturing problems reducible to a circuit family of weft t.

11

Publications

392

Citations

17

Authors

14

Institutions

Publications per year

2017–2026

0

Authors

17

  1. MR
    Michael R. Fellows

    University of Victoria, Canada

    3 publications · 140 citations

    3

    h-index

  2. RG
    Rodney G. Downey

    Victoria University of Wellington, New Zealand

    2 publications · 74 citations

    2

    h-index

  3. KW
    Kenneth W. Regan

    University at Buffalo, State University of New York, United States

    2 publications · 74 citations

    2

    h-index

  4. MY
    Mihalis Yannakakis

    AT&T (United States), United States

    1 publications · 54 citations

    1

    h-index

  5. AM
    A. M. Semikhatov

    P.N. Lebedev Physical Institute of the Russian Academy of Sciences, Russia

    1 publications · 23 citations

    1

    h-index

1–5 of 17

Venues

  1. Modern Applied Science

    1 publications · 29 citations

    1

    h-index

  2. Journal of Mathematical Sciences

    1 publications · 18 citations

    1

    h-index

  3. Journal of Computer and System Sciences

    1 publications · 54 citations

    1

    h-index

  4. Symposium on the Theory of Computing

    Conference · 1 publications · 66 citations

    1

    h-index

  5. Journal of High Energy Physics

    JHEP · 1 publications · 38 citations

    1

    h-index

1–5