Complexity Classes

Complexity Classes is a formal category in computational complexity theory that classifies computational problems according to the resources, such as time or space, required by algorithms to solve them on abstract machines like Turing machines.

482

Publications

29.9K

Citations

652

Authors

333

Institutions

Publications per year

2017–2026

31

Authors

652

  1. NI
    Neil Immerman

    University of Massachusetts Amherst, United States

    13 publications · 998 citations

    13

    h-index

  2. JH
    Jack H. Lutz

    Iowa State University, United States

    10 publications · 499 citations

    10

    h-index

  3. AL
    Alan L. Selman

    University at Buffalo, State University of New York, United States

    9 publications · 482 citations

    9

    h-index

  4. EA
    Eric Allender

    Rutgers, The State University of New Jersey, United States

    8 publications · 346 citations

    8

    h-index

  5. US
    Uwe Schöning

    University of Stuttgart, Germany

    8 publications · 619 citations

    8

    h-index

1–5 of 652

Venues

  1. SIAM Journal on Computing

    45 publications · 4.2K citations

    27

    h-index

  2. Theoretical Computer Science

    25 publications · 911 citations

    17

    h-index

  3. Journal of Computer and System Sciences

    22 publications · 3.7K citations

    17

    h-index

  4. Journal of the ACM

    JACM · 14 publications · 1.3K citations

    14

    h-index

  5. Information and Computation

    12 publications · 424 citations

    12

    h-index

1–5