Circuit Depth Complexity

Circuit Depth Complexity is the minimum depth, measured as the length of the longest path from an input node to an output node, among all Boolean circuits that compute a given function, where depth corresponds to the number of layers of logic gates in the circuit.

120

Publications

7.2K

Citations

249

Authors

124

Institutions

Publications per year

2017–2026

36

Variants

Circuit Depth

Authors

249

  1. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    6 publications · 594 citations

    6

    h-index

  2. RR
    Ran Raz

    Weizmann Institute of Science, Israel

    4 publications · 231 citations

    4

    h-index

  3. VG
    Vince Grolmusz

    Eötvös Loránd University, Hungary

    3 publications · 46 citations

    3

    h-index

  4. MK
    Mauricio Karchmer

    Hebrew University of Jerusalem, Israel

    3 publications · 486 citations

    3

    h-index

  5. JH
    Johan Håstad

    KTH Royal Institute of Technology, Sweden

    3 publications · 653 citations

    3

    h-index

1–5 of 249

Venues

  1. SIAM Journal on Computing

    11 publications · 902 citations

    10

    h-index

  2. arXiv (Cornell University)

    Repository · 8 publications · 241 citations

    8

    h-index

  3. Physical Review Letters

    PRL · 5 publications · 482 citations

    5

    h-index

  4. Theoretical Computer Science

    4 publications · 137 citations

    4

    h-index

  5. Information and Computation

    3 publications · 80 citations

    3

    h-index

1–5