Time Complexity

Time Complexity is a computational complexity measure that belongs to the class of resource-bounded complexity measures, specifically characterized by the amount of time required by an algorithm to solve a problem as a function of the input size.

2.5K

Publications

144.1K

Citations

3.3K

Authors

1.1K

Institutions

Publications per year

2017–2026

335

Authors

3.3K

  1. MR
    Michael R. Fellows

    University of Victoria, Canada

    21 publications · 1.6K citations

    19

    h-index

  2. AA
    Amir Abboud

    Stanford University, United States

    20 publications · 1.1K citations

    17

    h-index

  3. SC
    Stephen Cook

    University of Toronto, Canada

    16 publications · 1.7K citations

    16

    h-index

  4. FV
    Fedor V. Fomin

    University of Bergen, Norway

    21 publications · 1.2K citations

    16

    h-index

  5. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    20 publications · 1K citations

    16

    h-index

1–5 of 3.3K

Venues

  1. SIAM Journal on Computing

    204 publications · 16.6K citations

    70

    h-index

  2. Journal of the ACM

    JACM · 61 publications · 9.4K citations

    43

    h-index

  3. Theoretical Computer Science

    101 publications · 8.4K citations

    39

    h-index

  4. Journal of Computer and System Sciences

    57 publications · 6.9K citations

    32

    h-index

  5. arXiv (Cornell University)

    Repository · 84 publications · 2.2K citations

    26

    h-index

1–5