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

Authors

57

  1. SA
    Scott Aaronson

    Massachusetts Institute of Technology, United States

    4 publications · 261 citations

    4

    h-index

  2. LT
    Leen Torenvliet

    University of Amsterdam, Netherlands

    3 publications · 75 citations

    3

    h-index

  3. JS
    Joel Seiferas

    University of Rochester, United States

    3 publications · 234 citations

    3

    h-index

  4. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    3 publications · 237 citations

    3

    h-index

  5. HB
    Harry Buhrman

    Centrum Wiskunde & Informatica, Netherlands

    3 publications · 75 citations

    3

    h-index

1–5 of 57

Venues

  1. SIAM Journal on Computing

    3 publications · 64 citations

    3

    h-index

  2. Journal of the ACM

    JACM · 2 publications · 196 citations

    2

    h-index

  3. Theoretical Computer Science

    2 publications · 50 citations

    2

    h-index

  4. ArXiv.org

    Repository · 2 publications · 30 citations

    2

    h-index

  5. Information and Computation

    2 publications · 60 citations

    2

    h-index

1–5