Complexity Class Separations
Complexity Class Separations is a theoretical construct in computational complexity theory that distinguishes between distinct complexity classes by proving that one class properly contains another, thereby establishing a strict hierarchy in computational resource requirements.
30
Publications
1.1K
Citations
57
Authors
38
Institutions
Publications per year
2017–2026
2
30
Separating Nondeterministic Time Complexity Classes
Joel Seiferas, Michael J. Fischer, Albert R. Meyer · Journal of the ACM · 1978 · 180 citations · Full text
Scott Aaronson, Avi Wigderson · ACM Transactions on Computation Theory · 2009 · 156 citations
Sitan Chen, Jordan Cotler, Hsin-Yuan Huang et al. · Nature Communications · 2023 · 85 citations · Full text
Symposium on Theoretical Aspects of Computer Science
Max Crochemore, Costas S. Iliopoulos, Marcin Kubica et al. · 2008 · 66 citations
Scott Aaronson, Avi Wigderson · 2008 · 64 citations
1–5 of 30
57
4
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 57
38
University of California, Berkeley
Berkeley, United States
3 h-index
4 publications
229 citations

University of Rochester
Rochester, United States
3 h-index
3 publications
58 citations

Institute for Advanced Study
Princeton, United States
2 h-index
2 publications
84 citations
Microsoft (United States)
Redmond, United States
2 h-index
2 publications
99 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
244 citations
University of Washington
Seattle, United States
2 h-index
2 publications
196 citations
Moscow Institute of Thermal Technology
Moscow, Russia
2 h-index
2 publications
173 citations

Universitat Pompeu Fabra
Barcelona, Spain
2 h-index
2 publications
70 citations
1–8 of 38
3 publications · 64 citations
3
h-index
JACM · 2 publications · 196 citations
2
h-index
2 publications · 50 citations
2
h-index
Repository · 2 publications · 30 citations
2
h-index
2 publications · 60 citations
2
h-index
1–5