Circuit Lower Bounds

Circuit Lower Bounds is a fundamental research direction in computational complexity theory that establishes rigorous limits on the size or depth of Boolean circuits required to compute specific functions, thereby distinguishing the inherent computational difficulty of problems within various complexity classes.

711

Publications

37.7K

Citations

851

Authors

403

Institutions

Publications per year

2017–2026

82

Authors

851

  1. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    24 publications · 1.3K citations

    17

    h-index

  2. RW
    Ryan Williams

    Stanford University, United States

    20 publications · 841 citations

    16

    h-index

  3. RI
    Russell Impagliazzo

    University of California San Diego, United States

    16 publications · 1.3K citations

    15

    h-index

  4. RR
    Ran Raz

    Weizmann Institute of Science, Israel

    14 publications · 561 citations

    13

    h-index

  5. PP
    Pavel Pudlák

    Czech Academy of Sciences, Institute of Mathematics, Czechia

    12 publications · 1.1K citations

    12

    h-index

1–5 of 851

Venues

  1. SIAM Journal on Computing

    61 publications · 4.4K citations

    30

    h-index

  2. Journal of Computer and System Sciences

    19 publications · 1.5K citations

    16

    h-index

  3. Information Processing Letters

    21 publications · 594 citations

    15

    h-index

  4. IEEE Transactions on Computers

    19 publications · 755 citations

    15

    h-index

  5. Theoretical Computer Science

    16 publications · 683 citations

    14

    h-index

1–5