Circuit Complexity

Circuit Complexity is a branch of computational complexity theory that classifies computational problems according to the size and depth of Boolean circuits required to solve them, distinguishing it from other complexity measures by focusing on non-uniform models of computation.

3.3K

Publications

180.2K

Citations

5.1K

Authors

1.4K

Institutions

Publications per year

2017–2026

523

Authors

5.1K

  1. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    46 publications · 3.5K citations

    28

    h-index

  2. RI
    Russell Impagliazzo

    University of California San Diego, United States

    32 publications · 4K citations

    25

    h-index

  3. RW
    Ryan Williams

    Stanford University, United States

    28 publications · 1.5K citations

    21

    h-index

  4. RD
    Rolf Drechsler

    University of Bremen, Germany

    31 publications · 1.3K citations

    20

    h-index

  5. IL
    Igor L. Markov

    University of Michigan, United States

    20 publications · 1.7K citations

    18

    h-index

1–5 of 5.1K

Venues

  1. SIAM Journal on Computing

    143 publications · 12K citations

    55

    h-index

  2. IEEE Transactions on Computers

    122 publications · 9.2K citations

    46

    h-index

  3. 43

    h-index

  4. Theoretical Computer Science

    59 publications · 2.3K citations

    26

    h-index

  5. Journal of Computer and System Sciences

    37 publications · 4.6K citations

    25

    h-index

1–5