Complexity Hierarchies is a theoretical framework in computational complexity theory that classifies computational problems into nested levels based on their inherent resource requirements, where each level represents a distinct complexity class strictly contained within the next according to proven or conjectured separations.
71
Publications
3.6K
Citations
98
Authors
80
Institutions
Publications per year
2017–2026
8
Parents
Publications
71
1–5 of 71
Authors
98
- US
4
h-index
- KW
3
h-index
- JL
3
h-index
- LA
3
h-index
- VS
3
h-index
1–5 of 98
Institutions
80
Duke University
Durham, United States
3 h-index
3 publications
127 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
3 h-index
4 publications
149 citations
Cornell University
Ithaca, United States
3 h-index
3 publications
200 citations
University of Toronto
Toronto, Canada
2 h-index
2 publications
163 citations
University of Michigan
Ann Arbor, United States
2 h-index
4 publications
144 citations
University of Würzburg
Würzburg, Germany
2 h-index
2 publications
86 citations
University of California, Santa Barbara
Santa Barbara, United States
2 h-index
2 publications
107 citations
Yale University
New Haven, United States
2 h-index
2 publications
79 citations
1–8 of 80
Venues
- SIAM Journal on Computing
6 publications · 344 citations
6
h-index
- Theoretical Computer Science
4 publications · 147 citations
4
h-index
- RAIRO - Theoretical Informatics and Applications
ITA · 3 publications · 141 citations
3
h-index
- ACM SIGACT News
3 publications · 112 citations
3
h-index
- American Journal of Speech-Language Pathology
2 publications · 178 citations
2
h-index
1–5