Complexity Theory

Complexity Theory is a branch of theoretical computer science that classifies computational problems according to their inherent difficulty and relates these classes to one another based on the resources required for their solution.

4.3K

Publications

328.5K

Citations

5.5K

Authors

1.7K

Institutions

Publications per year

2017–2026

438

Authors

5.5K

  1. DS
    David S. Johnson

    AT&T (United States), United States

    23 publications · 2.2K citations

    19

    h-index

  2. SC
    Stephen Cook

    University of Toronto, Canada

    22 publications · 7.4K citations

    19

    h-index

  3. RI
    Russell Impagliazzo

    University of California San Diego, United States

    21 publications · 4.1K citations

    19

    h-index

  4. MR
    Michael R. Fellows

    University of Victoria, Canada

    22 publications · 4K citations

    19

    h-index

  5. JC
    Jin‐Yi Cai

    University of Wisconsin–Madison, United States

    26 publications · 934 citations

    15

    h-index

1–5 of 5.5K

Venues

  1. SIAM Journal on Computing

    151 publications · 18.9K citations

    60

    h-index

  2. Theoretical Computer Science

    157 publications · 10.6K citations

    47

    h-index

  3. Journal of the ACM

    JACM · 67 publications · 9.6K citations

    44

    h-index

  4. Journal of Computer and System Sciences

    86 publications · 11K citations

    44

    h-index

  5. Choice Reviews Online

    CRO · 36 publications · 9.3K citations

    28

    h-index

1–5