Computational Complexity

Computational Complexity is the branch of theoretical computer science that classifies computational problems according to their inherent difficulty in terms of the resources, particularly time and space, required to solve them using algorithms.

16.3K

Publications

1.1M

Citations

18K

Authors

3.3K

Institutions

Publications per year

2017–2026

1.9K

Authors

18K

  1. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    76 publications · 5.2K citations

    36

    h-index

  2. RE
    Robert E. Tarjan

    Princeton University, United States

    46 publications · 10.8K citations

    34

    h-index

  3. HL
    Hans L. Bodlaender

    Utrecht University, Netherlands

    52 publications · 5.5K citations

    34

    h-index

  4. MR
    Michael R. Fellows

    University of Victoria, Canada

    52 publications · 6.7K citations

    34

    h-index

  5. RI
    Russell Impagliazzo

    University of California San Diego, United States

    54 publications · 6.5K citations

    32

    h-index

1–5 of 18K

Venues

  1. SIAM Journal on Computing

    826 publications · 90.7K citations

    135

    h-index

  2. Journal of the ACM

    JACM · 307 publications · 49.1K citations

    101

    h-index

  3. Journal of Computer and System Sciences

    237 publications · 27.8K citations

    79

    h-index

  4. Theoretical Computer Science

    531 publications · 34.5K citations

    79

    h-index

  5. IEEE Transactions on Information Theory

    314 publications · 34.7K citations

    75

    h-index

1–5