Circuit Upper Bounds

Circuit Upper Bounds is a theoretical result in computational complexity theory that establishes an upper limit on the size or depth of Boolean circuits required to compute a given function or language within a specified complexity class.

376

Publications

21.1K

Citations

558

Authors

279

Institutions

Publications per year

2017–2026

44

Authors

558

  1. RW
    Ryan Williams

    Stanford University, United States

    14 publications · 480 citations

    13

    h-index

  2. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    11 publications · 844 citations

    10

    h-index

  3. RR
    Ran Raz

    Weizmann Institute of Science, Israel

    10 publications · 430 citations

    10

    h-index

  4. RI
    Russell Impagliazzo

    University of California San Diego, United States

    7 publications · 297 citations

    7

    h-index

  5. RA
    Rocco A. Servedio

    Columbia University, United States

    6 publications · 228 citations

    6

    h-index

1–5 of 558

Venues

  1. SIAM Journal on Computing

    28 publications · 1.4K citations

    22

    h-index

  2. Information Processing Letters

    12 publications · 395 citations

    12

    h-index

  3. IEEE Transactions on Information Theory

    10 publications · 580 citations

    10

    h-index

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

    Repository · 11 publications · 214 citations

    10

    h-index

  5. arXiv (Cornell University)

    Repository · 11 publications · 239 citations

    10

    h-index

1–5