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
Parents
11
1–5 of 11
17
3
h-index
2
h-index
University at Buffalo, State University of New York, United States
2 publications · 74 citations
2
h-index
1
h-index
P.N. Lebedev Physical Institute of the Russian Academy of Sciences, Russia
1 publications · 23 citations
1
h-index
1–5 of 17
14

Landau Institute for Theoretical Physics
Chernogolovka, Russia
2 h-index
2 publications
75 citations

European Organization for Nuclear Research
Geneva, Switzerland
1 h-index
1 publications
23 citations
University of Bahrain
Madīnat ‘Īsá, Bahrain
1 h-index
1 publications
29 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
38 citations

Victoria University of Wellington
Wellington, New Zealand
1 h-index
1 publications
46 citations
WuFeng University
Minxiong, Taiwan
1 h-index
1 publications
13 citations

University of Victoria
Victoria, Canada
1 h-index
1 publications
46 citations
National Chung Cheng University
Minxiong, Taiwan
1 h-index
1 publications
13 citations
1–8 of 14
1 publications · 29 citations
1
h-index
1 publications · 18 citations
1
h-index
1 publications · 54 citations
1
h-index
Conference · 1 publications · 66 citations
1
h-index
JHEP · 1 publications · 38 citations
1
h-index
1–5