Exponential Time Complexity

Exponential Time Complexity is a computational complexity class characterized by the set of decision problems solvable by a deterministic Turing machine in time bounded by an exponential function of the input size, distinguishing it from polynomial time complexity classes by its significantly faster growth rate.

774

Publications

43.9K

Citations

1.5K

Authors

609

Institutions

Publications per year

2017–2026

150

Authors

1.5K

  1. DK
    Dexter Kozen

    Cornell University, United States

    10 publications · 439 citations

    10

    h-index

  2. MC
    Marek Cygan

    University of Warsaw, Poland

    12 publications · 583 citations

    10

    h-index

  3. DM
    Dániel Marx

    Hungarian Academy of Sciences, Hungary

    10 publications · 381 citations

    10

    h-index

  4. MP
    Michał Pilipczuk

    University of Warsaw, Poland

    9 publications · 502 citations

    9

    h-index

  5. DB
    David Blaauw

    University of Michigan, United States

    9 publications · 1.1K citations

    9

    h-index

1–5 of 1.5K

Venues

  1. arXiv (Cornell University)

    Repository · 38 publications · 1.3K citations

    21

    h-index

  2. SIAM Journal on Computing

    30 publications · 2.9K citations

    20

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 23 publications · 363 citations

    14

    h-index

  4. Journal of the ACM

    JACM · 14 publications · 2K citations

    13

    h-index

  5. ACM Transactions on Algorithms

    TALG · 10 publications · 359 citations

    10

    h-index

1–5