Hierarchy Theorems is a theoretical framework in computational complexity theory that establishes strict containment relations among complexity classes by demonstrating that more computational resources (such as time or space) enable the solution of strictly more problems.
83
Publications
7K
Citations
126
Authors
58
Institutions
Publications per year
2017–2026
4
Parents
Publications
83
PP is as Hard as the Polynomial-Time Hierarchy
Seinosuke Toda · SIAM Journal on Computing · 1991 · 677 citations
Proceedings 35th Annual Symposium on Foundations of Computer Science
1994 · 595 citations
1–5 of 83
Authors
126
- ALAlan L. Selman
University at Buffalo, State University of New York, United States
5 publications · 226 citations
5
h-index
- JC
2
h-index
- LF
2
h-index
- MA
2
h-index
- SA
2
h-index
1–5 of 126
Institutions
58
University of Michigan
Ann Arbor, United States
3 h-index
6 publications
174 citations
University at Buffalo, State University of New York
Buffalo, United States
3 h-index
5 publications
81 citations
Iowa State University
Ames, United States
3 h-index
3 publications
181 citations
University of Chicago
Chicago, United States
3 h-index
5 publications
222 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
2 h-index
2 publications
114 citations
Cornell University
Ithaca, United States
2 h-index
2 publications
147 citations
University of Iowa
Iowa City, United States
2 h-index
2 publications
101 citations
Universität Trier
Trier, Germany
2 h-index
2 publications
65 citations
1–8 of 58
Venues
- SIAM Journal on Computing
6 publications · 896 citations
6
h-index
- Theoretical Computer Science
5 publications · 227 citations
5
h-index
- HAL (Le Centre pour la Communication Scientifique Directe)
Repository · 3 publications · 286 citations
3
h-index
- ACM SIGACT News
2 publications · 73 citations
2
h-index
- Journal of the ACM
JACM · 2 publications · 96 citations
2
h-index
1–5