Deterministic Complexity

Deterministic Complexity is a theoretical construct in computational complexity theory that characterizes the minimum amount of computational resources required by a deterministic algorithm to solve a decision problem in the worst case.

80

Publications

3.3K

Citations

139

Authors

87

Institutions

Publications per year

2017–2026

12

Authors

139

  1. YC
    Yi‐Jun Chang

    University of Michigan, United States

    6 publications · 216 citations

    6

    h-index

  2. SP
    Seth Pettie

    University of Michigan, United States

    6 publications · 228 citations

    6

    h-index

  3. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    4 publications · 159 citations

    4

    h-index

  4. JD
    Jonathan D. Phillips

    University of Kentucky, United States

    3 publications · 73 citations

    3

    h-index

  5. TK
    Tsvi Kopelowitz

    University of Michigan, United States

    3 publications · 153 citations

    3

    h-index

1–5 of 139

Venues

  1. SIAM Journal on Computing

    4 publications · 102 citations

    4

    h-index

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

    Repository · 4 publications · 66 citations

    4

    h-index

  3. SIAM Journal on Discrete Mathematics

    2 publications · 120 citations

    2

    h-index

  4. Information Processing Letters

    2 publications · 94 citations

    2

    h-index

  5. Geographical Analysis

    2 publications · 44 citations

    2

    h-index

1–5